A Full Nesterov–Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization
- 410 Downloads
After a brief introduction to Jordan algebras, we present a primal–dual interior-point algorithm for second-order conic optimization that uses full Nesterov–Todd steps; no line searches are required. The number of iterations of the algorithm coincides with the currently best iteration bound for second-order conic optimization. We also generalize an infeasible interior-point method for linear optimization to second-order conic optimization. As usual for infeasible interior-point methods, the starting point depends on a positive number. The algorithm either finds a solution in a finite number of iterations or determines that the primal–dual problem pair has no optimal solution with vanishing duality gap.
KeywordsFeasible interior-point method Infeasible interior-point method Second-order conic optimization Jordan algebra Polynomial complexity
Authors wish to thank Professor Florian Potra and four anonymous referees for useful comments and suggestions on an earlier draft of the manuscript. The first author would like to thank for the financial grant from Shahrekord University. The first author was also partially supported by the Center of Excellence for Mathematics, University of Shahrekord, Shahrekord, Iran.
- 2.Vanderbei, R.J., Yurttan, H.: Using LOQO to solve second-order cone programming problems. Report sor 98-09, Princeton University, Princeton, USA (1998) Google Scholar
- 3.Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. International Series in Operations Research & Management Science, vol. 27. Kluwer, Boston (2000) Google Scholar
- 5.Ji, J., Potra, F.A., Sheng, R.: On a general class of interior-point algorithms for semidefinite with polynomial complexity and super convergence programming. Methods Appl. Anal. 6(4) (1999) Google Scholar
- 8.Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM, Philadelphia (1993) Google Scholar
- 11.Adler, I., Alizadeh, F.: Primal–dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems. Technical Report RRR-111-95, Rutger Center for Operations Research, Brunswick, NJ (1995) Google Scholar
- 27.Mansouri, H.: Full-Newton step interior-point methods for conic optimization. PhD thesis, ISBN 978-90-9023179-2. Faculty of Electrical Engineering, Mathematics and Computer Science, The Netherlands (2008) Google Scholar
- 31.Vieira, M.V.C.: Jordan algebraic approach to symmetric optimization. PhD thesis, ISBN 978-90-6464-189-3. Faculty of Electrical Engineering, Mathematics and Computer Science, The Netherlands (2007) Google Scholar