Primal-dual interior-point methods for second-order conic optimization based on self-regular proximities

SIAM Journal on Optimization

Volumn 13, Issue 1, 2003, Pages 179-203

  Peng, Jiming ^a   Roos, Cornelis ^b   Terlaky, Tamás ^a  

^a MCMASTER UNIVERSITY   (Canada)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Polynomial complexity; Primal dual interior point method; Second order conic optimization; Self regular proximity function

Indexed keywords

EID: 0037288631     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401383236     Document Type: Article

References (27)

1. I. ADLER AND F. ALIZADEH, Primal-Dual Interior Point Algorithms for Convex Quadratically Constrained and Semidefinite Optimization Problems, Technical report RRR-111-95, Rutgers Center for Operations Research, New Brunswick, NJ, 1995.
2. F. ALIZADEH, J.P. HAEBERLY, AND M.L. OVERTON, A new primal-dual interior-point method for semidefinite programming, in Proceedings of the 5th SIAM Conference on Applied Linear Algebra, Snowbird, UT, J.G. Lewis, ed., Proc. Appl. Math. 72, SIAM, Philadelphia, 1994, pp. 113-117.
3. F. ALIZADEH AND S. SCHMIETA, Symmetric cones, potential reduction methods and word-by-word extensions, in Handbook of Semidefinite Programming (Theory, Algorithms and Applications), H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Kluwer Academic Publishers, Boston, 2000, pp. 195-234.
4. E.D. ANDERSEN, C. ROOS, AND T. TERLAKY, On Implementing a Primal-Dual Interior-Point Method for Conic Quadratic Optimization, Technical report, Faculty of Information Technology and System, Delft University of Technology, Delft, The Netherlands, 2000.
5. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications, MPS-SIAM Ser. Optim. MP02, SIAM, Philadelphia, 2001.
6. J. FARAUT AND A. KORÁNYI, Analysis on Symmetric Cones, Oxford University Press, London, Oxford, UK, 1994.
7. L. FAYBUSOVICH, Euclidean Jordan algebras and interior-point algorithms, Positivity, 1 (1997), pp. 331-357.
8. L. FAYBUSOVICH, A Jordan-Algebraic Approach to Potential-Reduction Algorithms, Technical report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, 1998.
9. M. FUKUSHIMA, Z.Q. LUO, AND P. TSENG, Smoothing functions for second-order-cone complementarity problems, SIAM J. Optim., 12 (2001), pp. 436-460.
10. N.K. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
11. E. DE KLERK, Interior Point Methods for Semidefinite Programming, Ph.D. Thesis, Faculty of ITS/TWI, Delft University of Technology, Delft, The Netherlands, 1997.
12. M.S. LOBO, L. VANDENBERGHE, S. BOYD, AND H. LEBRET, Applications of second-order cone programming, Linear Algebra Appl., 284 (1998), pp. 193-228.
13. R.D.C. MONTEIRO AND T. TSUCHIYA, Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions, Math. Program., 88 (2000), pp. 61-83.
14. A.S. NEMIROVSKII AND K. SCHEINBERG, Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic programming, Math. Programming, 72 (1996), pp. 273-289.
15. Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
16. Y.E. NESTEROV AND M.J. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
17. Y.E. NESTEROV AND M.J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
18. J. PENG, New Design and Analysis of Interior-Point Methods, Ph.D. thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands, 2001.
19. J. PENG, C. ROOS, AND T. TERLAKY, A new class of polynomial primal-dual methods for linear and semidefinite optimization, European J. Oper. Res., to appear.
20. J. PENG, C. ROOS, AND T. TERLAKY, Self-regular proximities and new search directions for linear and semidefinite optimization, Math. Programming, to appear.
21. W. RUDIN, Principles of Mathematical Analysis, MacGraw-Hill, New York, 1978.
22. S. SCHMIETA AND F. ALIZADEH, Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones, Math. Oper. Res., 26 (2001), pp. 543-564.
23. S. SCHMIETA AND F. ALIZADEH, Extension of Primal-Dual Interior-Point Algorithms to Symmetric Cones, Technical report RRR 13-99, Rutgers Center for Operations Research, Rutgers University, Piscataway, NJ, 1999.
24. J. STURM, Theory and algorithms of semidefinite programming, in High Performance Optimization, H. Frenk, C. Roos, T. Terlaky, and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999, pp. 3-194.
25. T. TSUCHIYA, A Polynomial Primal-Dual Path-Following Algorithm for Second-Order Cone Programming, Technical report 649, The Institute of Statistical Mathematics, Tokyo, 1997.
26. T. TSUCHIYA, A convergent analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, Optim. Methods Softw., 11/12 (1999), pp. 141-182.
27. H. WOLKOWICZ, R. SAIGAL, AND L. VANDENBERGHE, EDS., Handbook of Semidefinite Programming (Theory, Algorithms and Applications), Kluwer Academic Publishers, Boston, 2000.