The Q method for second order cone programming

Computers and Operations Research

Volumn 35, Issue 5, 2008, Pages 1510-1538

  Xia, Yu ^a   Alizadeh, Farid ^b  

^a INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

^b the State University of New Jersey   (United States)

Author keywords

Infeasible interior point method; Second order cone programming; The Q method

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

INFEASIBLE INTERIOR POINT METHODS; Q METHODS; SECOND ORDER CONE PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 34748820562     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.08.009     Document Type: Article

References (12)

1. Alizadeh F., and Goldfarb D. Second-order cone programming. Mathematical Programming 95 1, Ser. B (2003) 3-51
2. Alizadeh F., Haeberly J.P., and Overton M.L. A new primal-dual interior point method for semidefinite programming. Proceedings of the fifth SIAM conference on applications of linear algebra. Snowbird, Utah (1994)
3. Alizadeh F., Haeberly J.P., and Overton M.L. Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization 8 3 (1998) 746-768 [electronic]
4. Xia Y, Alizadeh F. The Q Method for Symmetric Cone Programming. Manuscript, 2005.
5. Faraut J., and Korányi A. Analysis on symmetric cones (1994), Oxford University Press, Oxford, UK
6. Alizadeh F, Schmieta SH. Optimization with semidefinite, quadratic and linear constraints. Technical Report RRR 23-97, RUTCOR, Rutgers Univeristy, 1997.
7. Adler I, Alizadeh F. Primal-dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems. Technical Report RRR 46-95, RUTCOR, Rutgers University, 1995.
8. Mehrotra S. On the implementation of a primal-dual interior point method. SIAM Journal on Optimization 2 (1992) 575-601
9. Xue G., and Ye Y. An efficient algorithm for minimizing a sum of Euclidean norms with applications. SIAM Journal on Optimization 7 4 (1997) 1017-1036
10. Goldfarb D., and Scheinberg K. Product-form Cholesky factorization in interior point methods for second-order cone programming. Mathematical Programming 103 1, Ser. A (2005) 153-179
11. Kojima M., Megiddo N., and Mizuno S. A primal-dual infeasible-interior-point algorithm for linear programming. Mathematical Programming 61 3, Ser. A (1993) 263-280
12. Freund R.W., Jarre F., and Mizuno S. Convergence of a class of inexact interior-point algorithms for linear programs. Mathematics of Operations Research 24 1 (1999) 50-71