Interior-point methods for optimization
- 25 April 2008
- journal article
- research article
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 17, 191-234
Abstract
This article describes the current state of the art of interior-point methods (IPMs) for convex, conic, and general nonlinear optimization. We discuss the theory, outline the algorithms, and comment on the applicability of this class of methods, which have revolutionized the field over the last twenty years.Keywords
This publication has 68 references indexed in Scilit:
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programmingComputational Optimization and Applications, 2007
- An inexact primal–dual path following algorithm for convex quadratic SDPMathematical Programming, 2007
- An interior algorithm for nonlinear optimization that combines line search and trust region stepsMathematical Programming, 2005
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- ?Cone-free? primal-dual path-following and potential-reduction polynomial time interior-point methodsMathematical Programming, 2004
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Hyperbolic Polynomials and Convex AnalysisCanadian Journal of Mathematics, 2001
- On a homogeneous algorithm for the monotone complementarity problemMathematical Programming, 1999
- On homogeneous interrior-point algorithms for semidefinite programmingOptimization Methods and Software, 1998
- Variational methods for the solution of problems of equilibrium and vibrationsBulletin of the American Mathematical Society, 1943