An Augmented Penalization Algorithm for the Equality Constrained Minimization Problem
DOI:
https://doi.org/10.5540/tema.2002.03.02.0171Abstract
In this contribution an iterative method for solving the nonlinear minimization problem with equality constraints is presented. The method is based on the sequential minimization of the differentiable penalization function known as augmented Lagrangian. Each unconstrained minimization subproblem is solved by using a conjugate-gradient technique combined with a trust-region strategy of globalization, which is especially efficient for large-scale problems. The update of the multipliers and the penalty parameter is done by using standard schemes. The theoretical properties and the behavior of the algorithm are discussed. Details of the implementation are presented, the algorithm is tested with a set of classic problems and with a minimax formulation to the problems which belong to the well known family of Hard-Sphere Problems.References
[1] D.P. Bertsekas, “Constrained Optimization and Lagrange Multiplier Methods”, Athenas Scientific, Belmont, MA, 1996.
A.R. Conn, N.I.M. Gould and Ph.L. Toint, A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds, SIAM Journal on Numer. Analysis, 28, No.3 (1991), 545-572.
J.H. Conway and N.J.C. Sloane, “Sphere Packing, Lattices and Groups”, Springer-Verlag, New York, 1988.
J.P. Dussault, Augmented penalty algorithms, IMA Journal of Numerical Analysis, 18 (1998), 355-372.
N.I.M. Gould, On the convergence of a sequential penalty function method for constrained minimization, SIAM Journal on Numer. Analysis, 26 (1989), 107-128.
M.R. Hestenes, Multiplier and gradient methods, Journal of Optimization Theory and Applications, 4 (1969), 303-320.
W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, in “Lecture Notes in Economics and Mathematical Systems” (M. Beckmann and H.P. K¨unzi, eds.), 187, Springer-Verlag, Berlin, 1981.
N. Kreji´c, J.M. Martínez, M. Mello and E.A. Pilotta, Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of Hard-Spheres problems, Computational Optimization and Applications, 16 (2000), 247-263.
M.J.D. Powell, A method for nonlinear constraints in minimization problems, in “Optimization” (R. Fletcher, ed.), pp. 283-298, Academic Press, London, 1969.
K. Schittkowski, More test examples for nonlinear programming codes, in “Lecturs Notes in Economics and Mathematical Systems” (M. Beckmann and W. Krelle, eds.), Springer-Verlag, Berlin, 1987.
G.N. Sottosanto, “Un algoritmo de penalización aumentada para el problema de minimización con restricciones”, Master’s thesis, Departamento de Matemática, Universidad Nacional del Sur, Bahía Blanca, Argentina, 2001.
T. Steihaug, The conjugate-gradient method and trust-regions in large-scale ptimization, SIAM Journal on Numer. Analysis, 20(3) (1983), 626-637.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.