Abstract
When one solves Nonlinear Programming problems by means of algorithms that use merit criteria combining the objective function and penalty feasibility terms, a phenomenon called greediness may occur. Unconstrained minimizers attract the iterates at early stages of the calculations and, so, the penalty parameter needs to grow excessively, in such a way that ill-conditioning harms the overall convergence. In this paper a regularization approach is suggested to overcome this difficulty. An Augmented Lagrangian method is defined with the addition of a regularization term that inhibits the possibility that the iterates go far from a reference point. Convergence proofs and numerical examples are given.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Andreani, R., Martínez, J.M., Schuverdt, M.L.: On the relation between the constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125, 473–485 (2005)
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.L.: On Augmented Lagrangian Methods with general lower-level constraints. SIAM J. Optim. 18, 1286–1309 (2007)
Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Nashua (2000).
Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust Region Methods, MPS/SIAM Series on Optimization. Philadelphia, SIAM (2000)
Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York (1968)
Fletcher, R.: Practical Methods of Optimization. Academic Press, London (1987)
Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303–320 (1969)
Iusem, A.N.: Augmented Lagrangian methods and proximal point methods for convex optimization. Investig. Oper. 8, 11–49 (1999)
Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)
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)
Qi, L., Wei, Z.: On the constant positive linear dependence condition and its application to SQP methods. SIAM J. Optim. 10, 963–981 (2000)
Rockafellar, R.T.: A dual approach to solving nonlinear programming problems by unconstrained optimization. Math. Program. 5, 354–373 (1973)
Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control Optim. 12, 268–285 (1974)
Author information
Authors and Affiliations
Corresponding author
Additional information
E.V. Castelani was supported by PRONEX-Optimization (PRONEX—CNPq/FAPERJ E-26/171.164/2003—APQ1), FAPESP (Grants 06/53768-0 and 05-56773-1) and CNPq.
A.L.M. Martinez was supported by PRONEX-Optimization (PRONEX—CNPq/FAPERJ E-26/171.164/2003—APQ1), FAPESP (Grants 06/53768-0 and 05-56773-1) and CAPES.
J.M. Martínez was supported by PRONEX-Optimization (PRONEX—CNPq/FAPERJ E-26/171.164/2003—APQ1), FAPESP (Grant 06/53768-0) and CNPq.
Rights and permissions
About this article
Cite this article
Castelani, E.V., Martinez, A.L.M., Martínez, J.M. et al. Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians. Comput Optim Appl 46, 229–245 (2010). https://doi.org/10.1007/s10589-009-9271-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-009-9271-4