A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems
- 177 Downloads
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.
KeywordsSemidefinite programming Interior point methods Constraint reduction Primal dual infeasible Polynomial complexity
Mathematics Subject Classification90C22 65K05 90C51
We are very grateful to André Tits for careful reading of the manuscript, many suggestions, and insightful comments that helped shape the choice of active and inactive blocks, to Florian Potra for helpful discussions, and to anonymous referees for very careful reading and helpful suggestions.
- 2.Dantzig, G.B., Ye, Y.: A Build-Up Interior-Point Method for Linear Programming: Affine Scaling Form. Tech. Rep. Stanford University, Stanford (1991)Google Scholar
- 5.Hertog, D.D., Roos, C., Terlaky, T.: Adding and deleting constraints in the path-following method for LP. In: Advances in Optimization and Approximation, vol. 1, pp. 166–185. Springer, New York (1994)Google Scholar
- 9.Williams, J.A.: The Use of Preconditioning for Training Support Vector Machines, Master’s Thesis, Applied Mathematics and Scientific Computing Program. University of Maryland, College Park (2008)Google Scholar
- 14.Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming. Tech. rep., Manuscript presented at the Math. Programming Symposium, Ann Arbor, MI (1994)Google Scholar
- 24.Potra, F.A., Sheng, R.: Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood. Tech. Rep. 91, Reports on Computational Mathematics, Department of Mathematics, University of Iowa (1996)Google Scholar
- 31.Park, S.: Matrix Reduction in Numerical Optimization, Ph.D. Thesis, Computer Science Department, University of Maryland, College Park (2011). http://drum.lib.umd.edu/handle/1903/11751
- 32.Toh, K.C., Todd, M.J., Tütüncü, R.H.: On the implementation and usage of SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming, version 4.0. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, vol. 166, pp. 715–754. Springer, New York (2012)CrossRefGoogle Scholar
- 33.Park, S., O’Leary, D.P.: A Polynomial Time Constraint Reduced Algorithm for Semidefinite Optimization Problems, with Convergence Proofs. Tech. rep., University of Maryland, College Park (2015). http://www.optimization-online.org/DB_HTML/2013/08/4011.html