A note on embeddings for the Augmented Lagrange Method

Authors

  • Gemayqzel Bouza-Allende Universidad de La Habana, Cuba
  • Jurgen Guddat Humboldt-Universitat zu Berlin, Berlin, Germany

DOI:

https://doi.org/10.2298/YJOR1002183B

Keywords:

Augmented Lagrangian Method, JJT-regular, generalized critical points, generic set

Abstract

Nonlinear programs (P) can be solved by embedding problem P into one parametric problem P(t), where P(1) and P are equivalent and P(0), has an evident solution. Some embeddings fulfill that the solutions of the corresponding problem P(t) can be interpreted as the points computed by the Augmented Lagrange Method on P. In this paper we study the Augmented Lagrangian embedding proposed in [6]. Roughly speaking, we investigated the properties of the solutions of P(t) for generic nonlinear programs P with equality constraints and the characterization of P(t) for almost every quadratic perturbation on the objective function of P and linear on the functions defining the equality constraints.

References

Avelino, C., Vicente, L.N. (2003) Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method. J Optim. Theory Appl., 119(2): 215

Bazaraa, M.S., Scerali, H.D., Shetty, C.M. (1993) Nonlinear programming: Theory and algorithms. New York, itd: Wiley

Bertsekas, D.P. (1982) Comtrained optimization and Lagrange multiplier methods. New York-San Diego, itd: Academic Press

Bouza, A. (2001) A new embedding for the augmented Lagrange method. Investigacion Oper., 22(3): 145

Chen, B., Chen, X. (2000) A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints. Computational Optimization and Applications, 17(2/3): 131-158

Dentcheva, D., Gollmer, R., Guddat, J., Ruckmann, J. (1995) Pathfollowing methods in non linear optimization, multipliers embedding. ZOR, 41, str. 127-152

Dostal, Z., Friedlander, A., Santos, S.A. (1999) Augmented Lagrangians with adaptative precision control for quadratic programming problems with equality constrains. Computational Optimization and Applications, 14(1): 37-53

Gollmer, R., Kausmann, U., Nowack, D., Wendler, K., Bacallao, E.J. (2004) Computer program PAFO. Humboldt-Universitaet, Institut fuer Mathematik

Gomez, W. (2001) On generic quadratic penalty embeddings for non linear optimization problems. Optimization, 50 (3-4) 279-295

Gomez, W., Guddat, J., Jongen, H.Th., Ruckmann, J.J., Solano, C. (2000) Curvas críticas y saltos en la optimización no lineal. www.emis.de/monographs/curvas/index.html

Guddat, J., Guerra, F., Jongen, H.Th. (1990) Parametric optimization: Singularities, pathfollowing and jumps. Stuttgart: Teubner

Hirsch, M. (1976) Differential Topology. New York: Springer Verlag

Iusem, A.N. (1999) Augmented Lagrangean methods and proximal point methods for convex optimization. Investigacion Operativa, 8, 11-49

Jongen, H.Th., Jonker, P., Twilt, F. (1986) Critical sets in parametric optimization. Mathematical Programming Series A, 34, 3, 333-353

Jongen, H.Th., Jonker, P., Twilt, F. (1986) One-parameter families of optimization problems: Equality constraints. Journal of Optimization Theory and Applications, 48, 1, 141-161

Li, D., Sun, X.L. (2000) Local convexification of the Lagrangian function in nonconvex optimization. J Optim. Theory Appl., 104(1): 109

Lin, Z., Song, D. (1998) A continuation method for solving convex programming problems via Fischer reformulation. Optimization, 44(3): 291

Luenberger, D.G. (1984) Linear and nonlinear programming. Reading, MA, itd: Addison-Wesley

Schmidt, R. (2000) Eine Modifizierte Standard Einbettung zur Behandlung von Gleichungs und Ungleichungs Restriktionen. Humboldt Universitaet zu Berlin, Master’s thesis

Song, X. (2004) A non-interior path following method for convex quadratic programming problems with bound constraints. Comput. Optim. Appl., 27(3): 285

Watson, L. (2001) Theory of globally convergent probability-one homotopies for nonlinear programming. SIAM J. Optim., 11(3): 761

Wright, S.J. (1994) A path-following interior point algorithm for linear and quadratic problems. Annals of Operations Research, 62, 103-130

Downloads

Published

2010-09-01

Issue

Section

Research Articles