A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems
We present an infeasible primal-dual interior point method for semidefinite optimization problems, making use of constraint reduction. We show that the algorithm is globally convergent and has polynomial complexity, the first such complexity result for primal-dual constraint reduction algorithms for any class of problems. Our algorithm is a modification of one with no constraint reduction due to Potra and Sheng (1998) and can be applied whenever the data matrices are block diagonal. It thus solves as special cases any optimization problem that is a linear, convex quadratic, convex quadratically constrained, or second-order cone problem.
interior point methods constraint reduction polynomial complexity semidefinite programming primal dual infeasible 90c22 65k05 90c51