Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

DOI10.1016/S0168-9274(98)00101-9zbMATH Open0956.90026OpenAlexW2083926423MaRDI QIDQ1294553FDOQ1294553

C. Roos, E. 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

Recommendations

• Polynomial primal-dual affine scaling algorithms in semidefinite programming
• Primal-dual affine-scaling algorithms fail for semidefinite programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming

zbMATH Keywords

semidefinite programminginterior-point methodpotential reduction methodprimal-dual affine-scaling methods

Mathematics Subject Classification ID

Interior-point methods (90C51) Semidefinite programming (90C22) Numerical methods involving duality (49M29)

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Semidefinite Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Title not available (Why is that?)
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Sizing and Least-Change Secant Methods
• Long-step strategies in interior-point primal-dual methods
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On the Nesterov--Todd Direction in Semidefinite Programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A Centered Projective Algorithm for Linear Programming
• Title not available (Why is that?)
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Title not available (Why is that?)
• Symmetric primal-dual path-following algorithms for semidefinite programming
• A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
• The projective method for solving linear matrix inequalities
• A primal-dual potential reduction method for problems involving matrix inequalities
• Polynomial primal-dual affine scaling algorithms in semidefinite programming
• Title not available (Why is that?)
• Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
• A long-step primal-dual path-following method for semidefinite programming
• Title not available (Why is that?)

Cited In (6)

• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• Primal-dual affine-scaling algorithms fail for semidefinite programming
• A primal-dual affine-scaling potential-reduction algorithm for linear programming
• A scaled Gauss--Newton primal-dual search direction for semidefinite optimization
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
• Affine reductions for LPs and SDPs

Uses Software

• Sp

This page was built for publication: Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294553)