Abstract
The convergence properties of different updating methods for the multipliers in augmented Lagrangians are considered. It is assumed that the updating of the multipliers takes place after each line search of a quasi-Newton method. Two of the updating methods are shown to be linearly convergent locally, while a third method has superlinear convergence locally. Modifications of the algorithms to ensure global convergence are considered. The results of a computational comparison with other methods are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, pp. 303–320, 1969.
Powell, M. J. D.,A Method for Nonlinear Constraints in Minimization Problems, Optimization, Edited by R. Fletcher, Academic Press, London, England, 1969.
Buys, J. D.,Dual Algorithms for Constrained Optimization, Rijksuniversiteit de Leiden, Leiden, Holland, PhD Thesis, 1972.
Bertsekas, D. P.,Combined Primal-Dual and Penalty Methods for Constrained Minimization, SIAM Journal on Control, Vol. 13, pp. 521–544, 1975.
Miele, A., Cragg, E. E., Iyer, R. R., andLevy, A. V.,Use of the Augmented Penalty Function in Mathematical Programming Problems, Parts 1 and 2, Journal of Optimization Theory and Applications, Vol. 8, pp. 115–130 and 131–153, 1971.
Tripati, S. S., andNarendra, K. S.,Constrained Optimization Problems Using Multiplier Methods, Journal of Optimization Theory and Applications, Vol. 9, pp. 59–70, 1972.
O'Doherty, R. J., andPierson, B. O.,A Numerical Study of Multiplier Methods for Constrained Parameter Optimization, International Journal of Systems Science, Vol. 5, pp. 187–200, 1974.
Luenberger, D. G.,Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1973.
Rockafellar, R. T.,Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming, SIAM Journal on Control, Vol. 12, pp. 268–285, 1974.
Broyden, C. G.,The Convergence of a Class of Double-Bank Minimization Algorithms, 2, The New Algorithm, Journal of the Institute of Mathematics and its Applications, Vol. 6, pp. 222–231, 1970.
Fletcher, R.,A New Approach to Variable Metric Algorithms, Computer Journal, Vol. 13, pp. 317–322, 1970.
Goldfarb, D.,A Family of Variable Metric Methods Derived by Variational Means, Mathematics of Computation, Vol. 24, pp. 23–26, 1970.
Shanno, D. F.,Conditioning of Quasi-Newton Methods for Function Minimization, Mathematics of Computation, Vol. 24, pp. 647–656, 1970.
Broyden, C. G., Dennis, J. E., andMoré, J. J.,On the Local and Superlinear Convergence of Quasi-Newton Methods, Journal of the Institute of Mathematics and its Applications, Vol. 12, pp. 223–245, 1973.
Dennis, J. E., andMoré, J. J.,A Characterization of Superlinear Convergence and its Applications to Quasi-Newton Methods, Mathematics of Computation, Vol. 28, pp. 549–560, 1974.
Fletcher, R.,A Class of Methods for Nonlinear Programming with Termination and Convergence Properties, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, 1970.
Mårtensson, K.,A New Approach to Constrained Function Optimization, Journal of Optimization Theory and Applications, Vol. 12, pp. 531–554, 1973.
Glad, S. T.,Lagrange Multiplier Methods for Minimization under Equality Constraints, Department of Automatic Control, University of Lund, Lund, Sweden, Report No. 7323, 1973.
Glad, S. T.,Algorithms for Nonlinear Minimization with Equality and Inequality Constraints, Based on Lagrange Multipliers, Department of Automatic Control, University of Lund, Lund, Sweden, Report No. 7503, 1975.
Polak, E.,Computational Methods in Optimization, Academic Press, New York, New York, 1971.
Fletcher, R.,An Ideal Penalty Function for Constrained Optimization, Nonlinear Programming 2, Edited by O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Academic Press, New York, New York, 1974.
Abadie, J.,Numerical Experiments with the GRG Method, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, 1970.
Bertsekas, D. P.,On Penalty and Multiplier Methods for Constrained Minimization, SIAM Journal on Control and Optimization, Vol. 14, pp. 216–235, 1976.
Himmelblau, D. M.,Applied Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1972.
Colville, A. R.,A Comparative Study of Nonlinear Programming Codes, IBM, New York Scientific Center, Report No. 320–2949, 1968.
Rosen, J. B., andSuzuki, S.,Construction of Nonlinear Programming Test Problems, Communications of ACM, Vol. 8, p. 113, 1965.
Tapia, R. A.,Diagonalized Multiplier Methods and Quasi-Newton Methods for Constrained Optimization, Journal of Optimization Theory and Applications, Vol. 22, pp. 135–194, 1977.
Han, S. P.,Superlinearly Convergent Variable-Metric Algorithms for General Nonlinear Programming Problems, Mathematical Programming, Vol. 11, pp. 263–282, 1976.
Author information
Authors and Affiliations
Additional information
Communicated by D. G. Luenberger
This work was supported by the Swedish Institute of Applied Mathematics.
Rights and permissions
About this article
Cite this article
Glad, S.T. Properties of updating methods for the multipliers in augmented Lagrangians. J Optim Theory Appl 28, 135–156 (1979). https://doi.org/10.1007/BF00933239
Issue Date:
DOI: https://doi.org/10.1007/BF00933239