Infeasible potential reduction algorithms for semidefinite programming

MaRDI QIDQ4906146zbMATH OpenFDO

Authors Xinyuan Zhao, Kim-Chuan Toh

Publication date 7 February 2013

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol8/p725.html

zbMATH Keywords

semidefinite programmingphase Iphase IIinfeasible potential reduction algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22) Iterative numerical methods for linear systems (65F10)

Recommendations

• Infeasible interior point method for semidefinite programs
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• A primal-dual infeasible interior point algorithm for semidefinite programming
• scientific article; zbMATH DE number 1182578
• Convergence analysis of an inexact infeasible interior point method for semidefinite programming

Cited in

(4)

• scientific article; zbMATH DE number 2063456 (Why is no real title available?)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems
• On homogeneous interrior-point algorithms for semidefinite programming
• Starting-point strategies for an infeasible potential reduction method

This page was built for publication: Infeasible potential reduction algorithms for semidefinite programming

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