Second order cone programming relaxation of a positive semidefinite constraint

Optimization Methods and Software

Volumn 18, Issue 5, 2003, Pages 535-541

  Kim, Sunyoung ^a   Kojima, Masakazu ^b   Yamashita, Makoto ^b  

^a Ewha Womans University   (South Korea)

^b Tokyo Institute of Technology ^*  (Japan)

Author keywords

Convex relaxation; Nonconvex program; Quadratic program; Second order cone program; Semidefinite program

Indexed keywords

CONSTRAINT THEORY; MATRIX ALGEBRA; OPTIMIZATION; VECTORS;

CONVEX RELAXATION; SEMIDEFINITE PROGRAMMING (SDP);

QUADRATIC PROGRAMMING;

EID: 0242695798     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678031000148696     Document Type: Article

References (10)

1. F. Alizadeh and D. Goldfarb (2001). Second-order cone programming, Technical Report RRR Report number 51-2001, RUTCOR, Rutgers University.
2. S. Burer, R. D. C. Monteiro and Y. Zhang (1999). Solving semidefinite programs via nonlinear programming part I: Transformations and derivatives, School of Mathematics, Georgia Tech., Atlanta, Georgia 30332, USA.
3. M. Fukuda, M. Kojima, K. Murota and K. Nakata (2001). Exploiting sparsity in semidefinite programming via matrix completion I: General framework. SIAM Journal on Optimization, 11(3), 647-674.
4. C. Helmberg and F. Rendl (2000). A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673-696.
5. S. Kim and M. Kojima (2001). Second order cone programming relaxations of quadratic optimization problems. Optimization Methods and Software, 15, 201-224.
6. S. Kim and M. Kojima (2002). Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations, Research Report B-375, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152-8552, Japan, to appear in Computational Optimization and Applications.
7. M. Kojima, S. Kim and H. Waki (2003). A general framework for convex relaxation of polynomial optimization problems over cones. Journal of Operation Research Society of Japan, 46(2), 125-144.
8. M. Lobo, L. Vandenberghe, S. Boyd and H. Lebret (1998). Applications of second-order cone programming. Linear Algebra and its Applications, 284 193-228, Special Issue on Linear Algebra in Control, Signals and Image Processing.
9. M. Muramatsu and T. Suzuki (2003). A new second order cone programming relaxation for Max-cut problems. Journal of Operation Research Society of Japan, 46(2), 164-177.
10. F. Zhang (1991). Matrix Theory: Basic Results and Techniques. Springer-Verlag, New York, NY, USA.