Skip to main content
SpringerLink
Log in

Interior-point methods: An old and new approach to nonlinear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we discuss the main concepts of structural optimization, a field of nonlinear programming, which was formed by the intensive development of modern interior-point schemes.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Anstreicher, On long step path following and SUMT for linear and quadratic programming,SIOPT 6 (1996) 33–46.

    MATH  MathSciNet  Google Scholar 

  2. D.P. Bertsekas,Constrained Optimization and Lagrange Multipliers Methods (Academic Press, New York, 1982).

    Google Scholar 

  3. C.W. Carroll, An operations research approach to the economic optimization of a Kraft pulping process, Ph.D. Dissertation, Institute of Paper Chemistry, Appleton, WI, 1959.

    Google Scholar 

  4. J. Edmonds, Paths, trees and flowers,Canadian Journal of Mathematics 17 (1965) 449–467.

    MATH  MathSciNet  Google Scholar 

  5. A. Fiacco and G. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968); reissued by SIAM in 1995.

    MATH  Google Scholar 

  6. K.R. Frisch, Principles of linear programming — with particular reference to the double gradient form of the logarithmic potential method, Memorandum on October 18, 1954, University Institute of Economics, Oslo.

    Google Scholar 

  7. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problem using semi-definite programming.J. ACM 42 (1995) 1115–1145.

    Article  MATH  MathSciNet  Google Scholar 

  8. J.-L. Goffin, A. Haurie and J.-Ph. Vial, Decomposition and nondifferentiable optimization with the projective algorithm,Management Science 38 (1992) 284–302.

    MATH  Google Scholar 

  9. M.R. Hestenes, Multiplier and gradient method,J. Optim. Theory Appl. 4 (5) (1969) 303–320.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Huard, Résolution des P.M. à contraintes non-linéaires par la méthode des centres, Note A.D.F. HR 5.690, May 1964.

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

    Article  MATH  MathSciNet  Google Scholar 

  12. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds,Complexity of Computer Computations (Plenum Press, New York, 1972).

    Google Scholar 

  13. R.M. Karp, On the computational complexity of combinatorial problems,Networks 5 (1975) 45–68.

    MATH  MathSciNet  Google Scholar 

  14. L.G. Khachiyan, A polynomial-time algorithm in linear programming,Doklady Akademii Nauk SSSR 244 (1979) 1093–1096; English translation in:Soviet Mathematics Doklady 20 (1979) 191–194.

    MATH  MathSciNet  Google Scholar 

  15. L.G. Khachiyan and M.J. Todd, On the complexity of approximating the maximal inscribed ellipsoid for a polytope,Mathematical Programming 61 (1993) 137–159.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  17. Yu. Nesterov,Efficient Methods in Nonlinear Programming (Radio i Sviaz, Moscow, 1989) (in Russian).

    Google Scholar 

  18. Yu. Nesterov, Complexity estimates of some cutting plane methods based on the analytic barrier,Mathematical Programming 69 (1) (1995) 149–176.

    Article  MathSciNet  Google Scholar 

  19. Yu. Nesterov, Long-step strategies in interior-point primal-dual schemes,Mathematical Programming 76 (1–2) (1997) 47–94.

    Article  MathSciNet  Google Scholar 

  20. Yu. Nesterov, Quality of semidefinite relaxation for nonconvex quadratic optimization, CORE Discussion Paper #9719, 1997.

  21. Yu. Nesterov and A. Nemirovsky,Interior-Point Polynomial Algorithms in Convex Programming (SIAM, Philadelphia, PA, 1994).

    MATH  Google Scholar 

  22. Yu. Nesterov and M.J. Todd, Self-scaled cones and interior-point methods in nonlinear programming,Mathematics of Operations Research 22 (1997) 1–42.

    Article  MATH  MathSciNet  Google Scholar 

  23. Yu. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones,SIAM Journal on Optimization, to appear.

  24. Yu. Nesterov, M.J. Todd and Y. Ye, Primal-dual methods and infeasibility detectors for nonlinear programming problems,Mathematical Programming, to appear.

  25. G.R. Parisot, Résolution numérique approchée du problème de programmation linéaire par application de la programmation logarithmique, Ph.D. Dissertation, University of Lille, France, 1961.

    Google Scholar 

  26. M.J.D. Powell, A method for nonlinear constraints in minimization problems, in: R. Fletcher, ed.,Optimization (Academic Press, London, 1969) 283–298.

    Google Scholar 

  27. J. Renegar, A polynomial-time algorithm, based on Newton’s method, for linear programming,Mathematical Programming 40 (1988) 59–93.

    Article  MATH  MathSciNet  Google Scholar 

  28. C. Roos, T. Terlaky and J.P. Vial,Theory and Algorithms for Linear Optimization. An Interior-Point Approach (Wiley, New York, 1997).

    MATH  Google Scholar 

  29. H.H. Rosenbrock, Automatic method for finding the greatest or least value of a function,Computer J. 3 (1960) 175–184.

    Article  MathSciNet  Google Scholar 

  30. R.A. Tapia, Diagonalised multiplier methods and quasi-Newton methods for constrained optimization,JOTA 22 (1977) 135–194.

    Article  MATH  MathSciNet  Google Scholar 

  31. P.M. Vaidya, An algorithm for linear programming which requires O(((m +n)n 2 + (m +n)1.5 n)L) arithmetic operations,Mathematical Programming 47 (1990) 175–202.

    Article  MATH  MathSciNet  Google Scholar 

  32. A.P. Wierzbicki, A penalty function shifting method in constrained static optimization and its convergence properties,Arch. Autom. Telemech. 16 (4) (1971) 395–416.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Operations Research and Econometrics, Université Catholique de Louvain, 34 voie du Roman Pays, 1348, Louvain-la-Neuve, Belgium

    Yu. Nesterov

Authors
  1. Yu. Nesterov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nesterov, Y. Interior-point methods: An old and new approach to nonlinear programming. Mathematical Programming 79, 285–297 (1997). https://doi.org/10.1007/BF02614321

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02614321

Keywords

Search

Navigation