Skip to main content
Top

2021 | OriginalPaper | Chapter

9. Lagrangian Transformation and Interior Ellipsoid Methods

Author : Roman A. Polyak

Published in: Introduction to Continuous Optimization

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The NR approach produced a number of multipliers methods, which are primal exterior and dual interior.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Bregman, L.: The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200–217 (1967)MathSciNetCrossRef Bregman, L.: The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200–217 (1967)MathSciNetCrossRef
go back to reference Bregman, L., Censor, Y., Reich, S.: Dykstra algorithm as the nonlinear extention of Bregman’s optimization method. J. Convex Anal. 6(2), 319–333 (1999)MathSciNetMATH Bregman, L., Censor, Y., Reich, S.: Dykstra algorithm as the nonlinear extention of Bregman’s optimization method. J. Convex Anal. 6(2), 319–333 (1999)MathSciNetMATH
go back to reference Censor, Y., Zenios, S.: The Proximal minimization algorithm with d–functions. J. Optim. Theory Appl. 73, 451–464 (1992)MathSciNetCrossRef Censor, Y., Zenios, S.: The Proximal minimization algorithm with d–functions. J. Optim. Theory Appl. 73, 451–464 (1992)MathSciNetCrossRef
go back to reference Chen, G., Teboulle, M.: Convergence analysis of a proximal–like minimization algorithm using Bregman functions. SIAM J. Optim. 3(4), 538–543 (1993)MathSciNetCrossRef Chen, G., Teboulle, M.: Convergence analysis of a proximal–like minimization algorithm using Bregman functions. SIAM J. Optim. 3(4), 538–543 (1993)MathSciNetCrossRef
go back to reference Dikin, I.: Iterative solution of problems of linear and quadratic programming. Doklady Akademii Nauk SSSR 174, 747–748 (1967). Translated in Soviet Mathematics Doklady 8, 674–675 (1967) Dikin, I.: Iterative solution of problems of linear and quadratic programming. Doklady Akademii Nauk SSSR 174, 747–748 (1967). Translated in Soviet Mathematics Doklady 8, 674–675 (1967)
go back to reference Eckstein, J.: Nonlinear proximal point algorithms using bregman functions with applications to convex programming. Y. Math. Oper. Res. 18(1), 202–226 (1993)MathSciNetCrossRef Eckstein, J.: Nonlinear proximal point algorithms using bregman functions with applications to convex programming. Y. Math. Oper. Res. 18(1), 202–226 (1993)MathSciNetCrossRef
go back to reference Matioli, L., Gonzaga, C.: A new family of penalties for augmented lagrangian methods. Numer. Linear Algebra Appl. 15, 925–944 (2008)MathSciNetCrossRef Matioli, L., Gonzaga, C.: A new family of penalties for augmented lagrangian methods. Numer. Linear Algebra Appl. 15, 925–944 (2008)MathSciNetCrossRef
go back to reference Polyak, R.: Lagrangian transformation in convex optimization, Research Report-072004. Department of SEOR and Mathematical Science Department, GMU, Fairfax, pp 1–23 (2004) Polyak, R.: Lagrangian transformation in convex optimization, Research Report-072004. Department of SEOR and Mathematical Science Department, GMU, Fairfax, pp 1–23 (2004)
go back to reference Polyak, R.: Lagrangian transformation and interior ellipsoid methods. J. Optim. Theory Appl. (JOTA) 164(3), 966–992 (2015) Polyak, R.: Lagrangian transformation and interior ellipsoid methods. J. Optim. Theory Appl. (JOTA) 164(3), 966–992 (2015)
Metadata
Title
Lagrangian Transformation and Interior Ellipsoid Methods
Author
Roman A. Polyak
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-68713-7_9

Premium Partner