The interior-point revolution in optimization: History, recent developments, and lasting consequences
Publication:4829921
DOI10.1090/S0273-0979-04-01040-7zbMath1114.90153OpenAlexW2030723843WikidataQ59411947 ScholiaQ59411947MaRDI QIDQ4829921
Publication date: 1 December 2004
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0273-0979-04-01040-7
Semidefinite programming (90C22) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) History of operations research and mathematical programming (90-03)
Related Items (46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization
- Some properties of the Hessian of the logarithmic barrier function
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Primal-dual target-following algorithms for linear programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions
- Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Semidefinite optimization
- Solving Real-World Linear Programs: A Decade and More of Progress
- Path-Following Methods for Linear Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Numerical Optimization
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- Why a Pure Primal Newton Barrier Step May be Infeasible
- Interior Methods for Nonlinear Optimization
- Stability of Linear Equations Solvers in Interior-Point Methods
- Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization
- Semidefinite Programming
- Smoothed analysis of algorithms
- A trust region method based on interior point techniques for nonlinear programming.
- Linear programming. Foundations and extensions
This page was built for publication: The interior-point revolution in optimization: History, recent developments, and lasting consequences