Abstract
In this paper we introduce an augmented Lagrangian type algorithm for strictly convex quadratic programming problems with equality constraints. The new feature of the proposed algorithm is the adaptive precision control of the solution of auxiliary problems in the inner loop of the basic algorithm. Global convergence and boundedness of the penalty parameter are proved and an error estimate is given that does not have any term that accounts for the inexact solution of the auxiliary problems. Numerical experiments illustrate efficiency of the algorithm presented
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. Axelsson, Iterative Solution Methods, Cambridge University Press: Cambridge, 1994.
D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press: London, 1982.
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 Numerical Analysis, vol. 28, pp. 545–572, 1988.
Z. Dostál, “Domain decomposition and PDE with periodic boundary conditions,” in Domain Decomposition Methods fot Partial Differential Equations, D.E. Keyes, T.F. Chan, G. Meurant, J.S. Scroggs, and R.G. Voigt (Eds.), SIAM: Philadelphia, 1992, pp. 258–261.
Z. Dostál, A. Friedlander, and S.A. Santos, “Analysis of semicoercive contact problems using symmetric BEM and augmented Lagrangians,” Eng. Appl. Bound. El., vol. 18, pp. 195–201, 1996.
Z. Dostál, A. Friedlander, and S.A. Santos, “Augmented Lagrangians with adaptive precision control for quadratic programming with simple bounds and equality constraints,” and RP 74/96, IMECC-UNICAMP, Campinas, 1996.
R. Glowinski and P. Le Tallec, Augmented Lagrangians and Operator Splitting Methods, SIAM: Philadelphia, 1989.
G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd edition, John Hopkins University Press: Baltimore, 1989.
W.W. Hager, “Approximations to the multiplier method,” SIAM Journal on Numerical Analysis, vol. 22, pp. 16–46, 1985.
W.W. Hager, “Dual techniques for constraint optimization,” JOTA, vol. 55, pp. 37–71, 1987.
W.W. Hager, “Analysis and implementation of a dual algorithm for constraint optimization,” JOTA, vol. 79, pp. 37–71, 1993.
W.W. Hager, “Updating the inverse of a matrix,” SIAM Review, vol. 31, pp. 221–239, 1989.
M.R. Hestenes, “Multiplier and gradient methods,” JOTA, vol. 4, pp. 303–320, 1969.
P. Le Tallec and T. Sassi, “Domain decomposition for non-matching grids: augmented Lagrangians approach,” Mathematics of Computation, vol. 64, pp. 1367–1396, 1995.
D.G. Luenberger, Linear and Nonlinear Programming, 2nd edition, Addison-Wesley, 1984.
M.J.D. Powell, “A method for nonlinear constraints in minimization problems,” in Optimization, R. Fletcher (Ed.), Academic Press: New York, 1969, pp. 283–298.
R.T. Rockafellar, The multiplier method of Hestenes and Powell applied to convex programming, JOTA, vol. 12, pp. 555–562, 1973.
R.T. Rockafellar, “A dual approach to solving nonlinear programming problems by unconstrained optimization,” Mathematical Programming, vol. 5, pp. 354–373, 1973.
R.T. Rockafellar, Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM Journal on Control, vol. 12, pp. 268–285, 1974.
J.C. Simo, T.A. Laursen, “An augmented Lagrangian treatment in contact problems involving friction,” Comp. Structures, vol. 42, pp. 97–116, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dostál, Z., Friedlander, A. & Santos, S. Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Equality Constraints. Computational Optimization and Applications 14, 37–53 (1999). https://doi.org/10.1023/A:1008700911674
Issue Date:
DOI: https://doi.org/10.1023/A:1008700911674