Skip to main content
Top
Published in:
Cover of the book

2021 | OriginalPaper | Chapter

1. Introduction

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 first steps in Optimization go back to ancient times, when several isoperimetric problems were solved.

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 Barnes, E.R.: A variation on Karmarkar’s algorithm for solving linear programming problem. Math. Program. 36, 174–182 (1986)MathSciNetCrossRef Barnes, E.R.: A variation on Karmarkar’s algorithm for solving linear programming problem. Math. Program. 36, 174–182 (1986)MathSciNetCrossRef
go back to reference Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)MathSciNetCrossRef Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)MathSciNetCrossRef
go back to reference Gill, P., Murray, W., Saunders, J., Tomlin, J., Wright, M.: On projected Newton Barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Math. Program. 36, 183–209 (1986)MathSciNetCrossRef Gill, P., Murray, W., Saunders, J., Tomlin, J., Wright, M.: On projected Newton Barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Math. Program. 36, 183–209 (1986)MathSciNetCrossRef
go back to reference Gonzaga, C.: An algorithm for solving linear programming problems in O(n 3 L) operations. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 1–28. Springer, New York (1989) Gonzaga, C.: An algorithm for solving linear programming problems in O(n 3 L) operations. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 1–28. Springer, New York (1989)
go back to reference Kočvara, M., Stingl, M.: Resent Progress in the NLP-SDP Code PENNON, Workshop “Optimization and Applications”, Oberwalfach (2005) Kočvara, M., Stingl, M.: Resent Progress in the NLP-SDP Code PENNON, Workshop “Optimization and Applications”, Oberwalfach (2005)
go back to reference Kočvara, M., Stingl, M.: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. Math. Program. Series B 109(2–3), 413–444 (2007)MathSciNetCrossRef Kočvara, M., Stingl, M.: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. Math. Program. Series B 109(2–3), 413–444 (2007)MathSciNetCrossRef
go back to reference Kočvara, M., Stingl, M.: PENNON: Software for Linear and Nonlinear Matrix Inequalities (2015). arXiv:1504.07212v2 [mat. OC] Kočvara, M., Stingl, M.: PENNON: Software for Linear and Nonlinear Matrix Inequalities (2015). arXiv:1504.07212v2 [mat. OC]
go back to reference Lustig, I., Marsten, R., Shanno, D.: Computational experience with a primal-dual interior point method for linear programming. Linear Algebra Appl. 152, 191–222 (1991)MathSciNetCrossRef Lustig, I., Marsten, R., Shanno, D.: Computational experience with a primal-dual interior point method for linear programming. Linear Algebra Appl. 152, 191–222 (1991)MathSciNetCrossRef
go back to reference Lustig, I., Marsten, R., Shanno, D.: On implementing Mehrotra’s predictor-corrector interior point method for linear programming. SIAM J. Optim. 2, 435–449 (1992)MathSciNetCrossRef Lustig, I., Marsten, R., Shanno, D.: On implementing Mehrotra’s predictor-corrector interior point method for linear programming. SIAM J. Optim. 2, 435–449 (1992)MathSciNetCrossRef
go back to reference Lustig, I., Marsten, R., Shanno, D.: Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6(1), 1–14 (1994)MathSciNetCrossRef Lustig, I., Marsten, R., Shanno, D.: Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6(1), 1–14 (1994)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 Nemirovski, A., Yudin, D.: Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. Wiley, New York (1983) Nemirovski, A., Yudin, D.: Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. Wiley, New York (1983)
go back to reference Nesterov, Y., Nemirovski, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)CrossRef Nesterov, Y., Nemirovski, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)CrossRef
go back to reference Polyak, B.: Introduction to Optimization. Optimization Software, New York (1987)MATH Polyak, B.: Introduction to Optimization. Optimization Software, New York (1987)MATH
go back to reference Polyak, R., Teboulle, M.: Nonlinear rescaling and proximal–like methods in convex programming. Math. Program. 76, 265–284 (1997)MATH Polyak, R., Teboulle, M.: Nonlinear rescaling and proximal–like methods in convex programming. Math. Program. 76, 265–284 (1997)MATH
go back to reference Powell, M.: Some convergence properties of the modified log barrier methods for linear programming. SIAM J. Optim. 50(4), 695–739 (1995)MathSciNetCrossRef Powell, M.: Some convergence properties of the modified log barrier methods for linear programming. SIAM J. Optim. 50(4), 695–739 (1995)MathSciNetCrossRef
go back to reference Renegar, J.: A polynomial -time algorithm, based on Newton’s method, for linear programming. Math. Program. 40, 59–93 (1988)MathSciNetCrossRef Renegar, J.: A polynomial -time algorithm, based on Newton’s method, for linear programming. Math. Program. 40, 59–93 (1988)MathSciNetCrossRef
go back to reference Shepp, L., Vardi, Y.: Maximin likelihood reconstruction in emission tomography. IEEE Trans. Med. Imaging 1(2), 113–122 (1982)CrossRef Shepp, L., Vardi, Y.: Maximin likelihood reconstruction in emission tomography. IEEE Trans. Med. Imaging 1(2), 113–122 (1982)CrossRef
go back to reference Tseng, P., Bertsekas, D.: On the convergence of the exponential multipliers method for convex programming. Math. Program. 60, 1–19 (1993)MathSciNetCrossRef Tseng, P., Bertsekas, D.: On the convergence of the exponential multipliers method for convex programming. Math. Program. 60, 1–19 (1993)MathSciNetCrossRef
go back to reference Vanderbei, R., Meketon, M., Freedman, B.: A modification of Karmarkar’s linear programming algorithm. Algorithmica 1(4), 395–407 (1986)MathSciNetCrossRef Vanderbei, R., Meketon, M., Freedman, B.: A modification of Karmarkar’s linear programming algorithm. Algorithmica 1(4), 395–407 (1986)MathSciNetCrossRef
go back to reference Vardi, Y., Shepp, L., Kaufman, L.: A statistical model for position emission tomography. J. Am. Statist. Assoc. 80, 8–38 (1985)CrossRef Vardi, Y., Shepp, L., Kaufman, L.: A statistical model for position emission tomography. J. Am. Statist. Assoc. 80, 8–38 (1985)CrossRef
Metadata
Title
Introduction
Author
Roman A. Polyak
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-68713-7_1

Premium Partner