Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 73, 2024 - Issue 5
129
Views
0
CrossRef citations to date
0
Altmetric
Articles

Exact augmented Lagrangians for constrained optimization problems in Hilbert spaces I: theory

ORCID Icon
Pages 1355-1395 | Received 28 Jan 2022, Accepted 07 Dec 2022, Published online: 16 Dec 2022

References

  • Eremin II. The penalty method in convex programming. Soviet Math Dokl. 1966;8:459–462.
  • Zangwill WI. Nonlinear programming via penalty functions. Manag Sci. 1967;13:344–358.
  • Han SP, Mangasarian OL. Exact penalty functions in nonlinear programming. Math Program. 1979;17:251–269.
  • Di Pillo G, Grippo L. On the exactness of a class of nondifferentiable penalty functions. J Optim Theory Appl. 1988;57:399–410.
  • Di Pillo G, Facchinei F. Exact barrier function methods for Lipschitz programs. Appl Math Optim. 1995;32:1–31.
  • Demyanov VF. Nonsmooth optimization. In: Di Pillo G, Schoen F, editors. Nonlinear optimization. lecture notes in mathematics, Vol. 1989, Berlin-Heidelberg: Springer-Verlag; 2010. p. 55–164.
  • Zaslavski AJ. Optimization on metric and normed spaces. New York: Springer Science+Business Media; 2010.
  • Zaslavski AJ. A sufficient condition for exact penalty functions. Optim Lett. 2009;3:593–602.
  • Zaslavski AJ. Exact penalty property in optimization with mixed constraints via variational analysis. SIAM J Optim. 2013;23:170–187.
  • Dolgopolik MV. A unifying theory of exactness of linear penalty functions. Optim. 2016;65:1167–1202.
  • Maratos N. Exact penalty function algorithms for finite dimensional and control optimization problems [dissertation]. London: University of London; 1978.
  • Polak E. Optimization: algorithms and consistent approximations. New York: Springer-Verlag; 1997.
  • Nocedal J, Wright SJ. Numerical optimization. New York: Springer; 2006.
  • Bonnans JF, Gilbert JC, Lemaréchal C, et al. Numerical optimization. Berlin: Springer-Verlag; 2006.
  • Conn AR, Gould NIM, Toint PL. Trust-region methods. Philadelphia: SIAM; 2000.
  • Coope ID. The Maratos effect in sequential quadratic programming algorithms using the L1 exact penalty function. Technical Report No. CS-85-32. University of Waterloo; 1985. Available from: https://cs.uwaterloo.ca/research/tr/1985/CS-85-32.pdf.
  • Fletcher R. A class of methods for nonlinear programming with termination and convergence properties. In: Abadie J, editor. Integer and nonlinear programming. Amsterdam: North-Holland; 1970. p. 157–175.
  • Birgin EG, Martinez JM. Practical augmented Lagrangian methods for constrained optimization. Philadelphia: SIAM; 2014.
  • Rockafellar RT. Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J Control Optim. 1974;12:268–285.
  • Rockafellar RT. Lagrange multipliers and optimality. SIAM Rev. 1993;35:183–238.
  • Ito K, Kunisch K. The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces. Math Program. 1990;46:341–360.
  • Fletcher R. An exact penalty function for nonlinear programming with inequalities. Math Program. 1973;5:129–150.
  • Han SP, Mangasarian OL. A dual differentiable exact penalty function. Math Program. 1983;25:293–306.
  • Di Pillo G, Grippo L. A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints. SIAM J Control Optim. 1985;23:72–84.
  • Lucidi S. New results on a continuously differentiable exact penalty function. SIAM J Optim. 1992;2:558–574.
  • Contaldi G, Di Pillo G, Lucidi S. A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set. Oper Res Lett. 1993;14:153–161.
  • Fukuda EH, Silva PJS, Fukushima M. Differentiable exact penalty functions for nonlinear second-order cone programs. SIAM J Optim. 2012;22:1607–1633.
  • Estrin R, Friedlander MP, Orban D, et al. Implementing a smooth exact penalty function for equality-constrained nonlinear optimization. SIAM J Sci Comput. 2020;42:A1809–A1835.
  • Estrin R, Friedlander MP, Orban D, et al. Implementing a smooth exact penalty function for general constrained nonlinear optimization. SIAM J Sci Comput. 2020;42:A1836–A1859.
  • Di Pillo G, Grippo L. A new class of augmented Lagrangians in nonlinear programming. SIAM J Control Optim. 1979;17:618–628.
  • Di Pillo G, Grippo L. A new augmented Lagrangian function for inequality constraints in nonlinear programming problems. J Optim Theory Appl. 1982;36:495–519.
  • Lucidi S. New results on a class of exact augmented Lagrangians. J Optim Theory Appl. 1988;58:259–282.
  • Di Pillo G, Lucidi S. On exact augmented Lagrangian functions in nonlinear programming. In: Di Pillo G, Giannessi F, editors. Nonlinear optimization and applications. New York: Plenum Press; 1996. p. 85–100.
  • Di Pillo G, Lucidi S. An augmented Lagrangian function with improved exactness properties. SIAM J Optim. 2001;12:376–406.
  • Di Pillo G, Liuzzi G, Lucidi S, et al. Fruitful uses of smooth exact merit functions in constrained optimization. In: Di Pillo G, Murli A, editors. High performance algorithms and software for nonlinear optimization. Dordrecht: Kluwer Academic Publishers; 2003. p. 201–225.
  • Di Pillo G, Liuzzi G, Lucidi S, et al. An exact augmented Lagrangian function for nonlinear programming with two-sided constraints. Comput Optim Appl. 2003;25:57–83.
  • Luo H, Wu H, Liu J. Some results on augmented Lagrangians in constrained global optimization via image space analysis. J Optim Theory Appl. 2013;159:360–385.
  • Du X, Zhang L, Gao Y. A class of augmented Lagrangians for equality constraints in nonlinear programming problems. Appl Math Comput. 2006;172:644–663.
  • Du X, Liang Y, Zhang L. Further study on a class of augmented Lagrangians of Di Pillo and Grippo in nonlinear programming. J Shanghai Univ (Engl Ed). 2006;10:293–298.
  • Di Pillo G, Lucidi S, Palagi L. An exact penalty-Lagrangian approach for a class of constrained optimization problems with bounded variables. Optim. 1993;28:129–148.
  • Di Pillo G, Liuzzi G, Lucidi S. An exact penalty-Lagrangian approach for large-scale nonlinear programming. Optim. 2011;60:223–252.
  • Di Pillo G, Lucidi S, Palagi L. A truncated Newton method for constrained optimization. In: Di Pillo G, Giannessi F, editors. Nonlinear optimization and related topics. Dordrecht: Kluwer Academic Publishers; 2000. p. 79–103.
  • Di Pillo G, Lucidi S, Palagi L. Convergence to second-order stationary points of a primal-dual algorithm model for nonlinear programming. Math Oper Res. 2005;30:897–915.
  • Di Pillo G, Liuzzi G, Lucidi S, et al. A truncated Newton method in an augmented Lagrangian framework for nonlinear programming. Comput Optim Appl. 2010;45:311–352.
  • Fukuda E, Lourenço BF. Exact augmented Lagrangian functions for nonlinear semidefinite programming. Comput Optim Appl. 2018;71:457–482.
  • Dolgopolik MV. Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property. J Glob Optim. 2018;71:237–296.
  • Rudin W. Functional analysis. Singapore: McGraw-Hill; 1991.
  • Borwein JM, Dontchev AL. On the Bartle-Graves theorem. Proc Amer Math Soc. 2003;131:2553–2560.
  • Dolgopolik MV, Fominyh AV. Exact penalty functions for optimal control problems I: main theorem and free-endpoint problems. Optim Control Appl Methods. 2019;40:1018–1044.
  • Dolgopolik MV. Exact penalty functions for optimal control problems II: exact penalization of terminal and pointwise state constraints. Optim Control Appl Methods. 2020;41:898–947.
  • Ioffe AD, Tihomirov VM. Theory of extremal problems. Amsterdam: North-Holland; 1979.
  • Mawhin J, Willem M. Origin and evolution of the Palais-Smale condition in critical point theory. J Fixed Point Theory Appl. 2010;7:265–290.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.