Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
From MaRDI portal
Publication:1294553
DOI10.1016/S0168-9274(98)00101-9zbMath0956.90026OpenAlexW2083926423MaRDI QIDQ1294553
Cornelis Roos, Etienne de Klerk, Tamás Terlaky
Publication date: 29 June 1999
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(98)00101-9
semidefinite programminginterior-point methodpotential reduction methodprimal-dual affine-scaling methods
Semidefinite programming (90C22) Numerical methods involving duality (49M29) Interior-point methods (90C51)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Symmetric primal-dual path-following algorithms for semidefinite programming
- A long-step primal-dual path-following method for semidefinite programming
- Long-step strategies in interior-point primal-dual methods
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- The projective method for solving linear matrix inequalities
- Polynomial primal-dual affine scaling algorithms in semidefinite programming
- A primal-dual potential reduction method for problems involving matrix inequalities
- Sizing and Least-Change Secant Methods
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A Centered Projective Algorithm for Linear Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- Semidefinite Programming
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
