Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method. (English) Zbl 1094.90045

Summary: This paper contributes to the development of the field of augmented Lagrangian multiplier methods for general nonlinear programming by introducing a new update for the multipliers corresponding to inequality constraints. The update maintains naturally the nonnegativity of the multipliers without the need for a positive-orthant projection, as a result of the verification of the first-order necessary conditions for the minimization of a modified augmented Lagrangian penalty function.
In the new multiplier method, the roles of the multipliers are interchanged: the multipliers corresponding to the inequality constraints are updated explicitly, whereas the multipliers corresponding to the equality constraints are approximated implicitly. It is shown that the basic properties of local convergence of the traditional multiplier method are valid also for the proposed method.


90C30 Nonlinear programming
49M30 Other numerical methods in calculus of variations (MSC2010)


Full Text: DOI


[1] Bertsekas, D. P., Constrained Optimization and Lagrange Multiplier Methods, Computer Science and Applied Mathematics, Academic Press, New York, NY, 1982. · Zbl 0572.90067
[2] Conn, A.R., Gould, N.I.M., and Toint, P.L., A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds, SIAM Journal on Numerical Analysis, Vol. 28, pp. 545-572, 1991. · Zbl 0724.65067 · doi:10.1137/0728030
[3] Vicente, L.N., Local Analysis of a New Multipliers Method, European Journal of Operational Research, Vol. 143, pp. 432-451, 2002. · Zbl 1058.90065 · doi:10.1016/S0377-2217(02)00328-4
[4] Dennis, J. E., Heinkenschloss, M., and Vicente, L.N., Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems, SIAM Journal on Control and Optimization, Vol. 36, pp. 1750-1794, 1998. · Zbl 0921.90137 · doi:10.1137/S036012995279031
[5] Conn, A. R., Gould, N. I. M., and Toint, P. L., LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Verlag, New York, NY, 1992. · Zbl 0761.90087
[6] Goodman, J., Newton’s Method for Constrained Optimization, Mathematical Programming, Vol. 33, pp. 162-171, 1985. · Zbl 0589.90065 · doi:10.1007/BF01582243
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.