Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
  • First Online:
Introduction to Continuous Optimization

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 172))

  • 1075 Accesses

Abstract

The first steps in Optimization go back to ancient times, when several isoperimetric problems were solved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 79.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Barnes, E.R.: A variation on Karmarkar’s algorithm for solving linear programming problem. Math. Program. 36, 174–182 (1986)

    Article  MathSciNet  Google Scholar 

  • Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)

    Article  MathSciNet  Google Scholar 

  • Eggermont, P.: Multiplicative iterative algorithm for convex programming. Linear Algebra Appl. 130, 25–32 (1990)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • 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)

    Google Scholar 

  • Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  Google Scholar 

  • Kočvara, M., Stingl, M.: Resent Progress in the NLP-SDP Code PENNON, Workshop “Optimization and Applications”, Oberwalfach (2005)

    Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • Kočvara, M., Stingl, M.: PENNON: Software for Linear and Nonlinear Matrix Inequalities (2015). arXiv:1504.07212v2 [mat. OC]

    Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • Matioli, L., Gonzaga, C.: A new family of penalties for augmented lagrangian methods. Numer. Linear Algebra Appl. 15, 925–944 (2008)

    Article  MathSciNet  Google Scholar 

  • Melman, A., Polyak, R.: The Newton modified barrier method for QP problems. Ann. Oper. Res. 62, 465–519 (1996)

    Article  MathSciNet  Google Scholar 

  • Nemirovski, A., Yudin, D.: Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. Wiley, New York (1983)

    Google Scholar 

  • Nesterov, Y., Nemirovski, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)

    Book  Google Scholar 

  • Polyak, B.: Introduction to Optimization. Optimization Software, New York (1987)

    MATH  Google Scholar 

  • Polyak, R., Teboulle, M.: Nonlinear rescaling and proximal–like methods in convex programming. Math. Program. 76, 265–284 (1997)

    MATH  Google Scholar 

  • Powell, M.: Some convergence properties of the modified log barrier methods for linear programming. SIAM J. Optim. 50(4), 695–739 (1995)

    Article  MathSciNet  Google Scholar 

  • Renegar, J.: A polynomial -time algorithm, based on Newton’s method, for linear programming. Math. Program. 40, 59–93 (1988)

    Article  MathSciNet  Google Scholar 

  • Shepp, L., Vardi, Y.: Maximin likelihood reconstruction in emission tomography. IEEE Trans. Med. Imaging 1(2), 113–122 (1982)

    Article  Google Scholar 

  • Tseng, P., Bertsekas, D.: On the convergence of the exponential multipliers method for convex programming. Math. Program. 60, 1–19 (1993)

    Article  MathSciNet  Google Scholar 

  • Vanderbei, R., Meketon, M., Freedman, B.: A modification of Karmarkar’s linear programming algorithm. Algorithmica 1(4), 395–407 (1986)

    Article  MathSciNet  Google Scholar 

  • Vardi, Y., Shepp, L., Kaufman, L.: A statistical model for position emission tomography. J. Am. Statist. Assoc. 80, 8–38 (1985)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Technion, Haifa, Israel

    Roman A. Polyak

Authors
  1. Roman A. Polyak
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Polyak, R.A. (2021). Introduction. In: Introduction to Continuous Optimization. Springer Optimization and Its Applications, vol 172. Springer, Cham. https://doi.org/10.1007/978-3-030-68713-7_1

Download citation

Publish with us

Policies and ethics

Search

Navigation