Abstract
In this paper, we consider a nonlinear programming problem for which the constraint set may be infeasible. We propose an algorithm based on a large family of augmented Lagrangian functions and analyze its global convergence properties taking into account the possible infeasibility of the problem. We show that, in a finite number of iterations, the algorithm stops detecting the infeasibility of the problem or finds an approximate feasible/optimal solution with any required precision. We illustrate, by means of numerical experiments, that our algorithm is reliable for different Lagrangian/penalty functions proposed in the literature.
Similar content being viewed by others
References
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.: On augmented Lagrangian methods with general lower-level constraints. SIAM J. Optim. 18(4), 1286–1309 (2008)
Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)
Birgin, E.G., Castillo, R.A., Martínez, J.M.: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems. Comput. Optim. Appl. 31(1), 31–55 (2005)
Birgin, E.G., Martínez, J. M., Prudente, L.F.: Optimality properties of an augmented Lagrangian method on infeasible problems. Comput. Optim. Appl. doi:10.1007/s10589-014-9685-5
Birgin, E.G., Martínez, J.M., Prudente, L.F.: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming. J. Glob. Optim. 58(2), 207–242 (2014)
Burachik, R.S., Iusem, A.N., Melo, J.G.: A primal dual modified subgradient algorithm with sharp Lagrangian. J. Glob. Optim. 46(3), 347–361 (2010)
Byrd, R., Curtis, F., Nocedal, J.: Infeasibility detection and SQP methods for nonlinear optimization. SIAM J. Optim. 20(5), 2281–2299 (2010)
Conn, A.R., Gould, N.I.M., Toint, PhL: Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A). Springer, Secaucus (1992)
Floudas, C.A.: Deterministic Global Optimization: Theory, Methods and Application. Kluwer Academic Publishers, Dordrecht (1999)
Floudas, C.A., Visweswaran, V.: A global optimization algorithm (GOP) for certain classes of nonconvex NLPS II. Application of theory and test problems. Comput. Chem. Eng. 14, 1419–1434 (1990)
Griva, I., Polyak, R.: Primal-dual nonlinear rescaling method with dynamic scaling parameter update. Math. Program. 106(2), 237–259 (2006)
Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4(5), 303–320 (1969)
Kearfott, R.B., Dawande, M., Du, K., Hu, C.: Algorithm 737: Intlib & mdash: a portable Fortran 77 interval standard-function library. ACM Trans. Math. Softw. 20(4), 447–459 (1994)
Kort, B., Bertsekas, D.P.: Combined primal-dual and penalty methods for convex programming. SIAM J. Control Optim. 14(2), 268–294 (1976)
Liebman, J., Lasdon, L., Schrage, L., Waren, A.: Modeling and Optimization with GINO. The Scientic Press, Palo Alto (1986)
Luo, H.Z., Sun, X.L., Li, D.: On the convergence of augmented Lagrangian methods for constrained global optimization. SIAM J. Optim. 18(4), 1209–1230 (2007)
Mangasarian, O.: Unconstrained Lagrangians in nonlinear programming. SIAM J. Control Optim. 13(4), 772–791 (1975)
Manousiouthakis, M., Sourlas, D.: A global optimization approach to rationally constrained rational programming. Chem. Eng. Comm. 115(1), 127–147 (1992)
Martínez, J.M., Prudente, L.F.: Handling infeasibility in a large-scale nonlinear optimization algorithm. Numer. Algorithms 60(2), 263–277 (2012)
Musin, O.R.: The kissing number in four dimensions. Ann. Math. 168, 1–32 (2008)
Polyak, R.: Modified barrier functions (theory and methods). Math. Program. 54(1–3), 177–222 (1992)
Polyak, R., Griva, I.: Primal-dual nonlinear rescaling method for convex optimization. J. Optim. Theory Appl. 122(1), 111–156 (2004)
Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283–298. Academic Press, New York (1969)
Rockafellar, R.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control Optim. 12(2), 268–285 (1974)
Rubinov, A.M., Yang, X.Q.: Lagrange-Type Functions in Constrained Non-convex Optimization. Kluwer Academic Publishers, Dordrecht (2003)
Sahinidis, N.V., Grossmann, I.E.: Reformulation of the multiperiod milp model for capacity expansion of chemical processes. Oper. Res. 40(1), S127–S144 (1992)
Schtte, K., Waerden, B.L.: Das problem der dreizehn Kugeln. Math. Ann. 125(1), 325–334 (1952)
Swaney, R.E.: Global Solution of Algebraic Nonlinear Programs. AIChE Annual Meeting, Chicago (1990)
Wang, C.Y., Li, D.: Unified theory of augmented Lagrangian methods for constrained global optimization. J. Glob. Optim. 44(3), 433–458 (2009)
Wächter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25–57 (2006)
Acknowledgments
This work was supported in part by Projeto 136/11- CAPES/MES-Cuba, CNPq Grant 471815/2012-8 and 444134/2014-0, and FAPEG/GO.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gonçalves, M.L.N., Melo, J.G. & Prudente, L.F. Augmented Lagrangian methods for nonlinear programming with possible infeasibility. J Glob Optim 63, 297–318 (2015). https://doi.org/10.1007/s10898-015-0289-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-015-0289-0