메뉴 건너뛰기




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

Second order cone programming relaxation of a positive semidefinite constraint

Author keywords

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

Indexed keywords

CONSTRAINT THEORY; MATRIX ALGEBRA; OPTIMIZATION; VECTORS;

EID: 0242695798     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678031000148696     Document Type: Article
Times cited : (25)

References (10)
  • 3
    • 0035238840 scopus 로고    scopus 로고
    • Exploiting sparsity in semidefinite programming via matrix completion I: General framework
    • 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.
    • (2001) SIAM Journal on Optimization , vol.11 , Issue.3 , pp. 647-674
    • Fukuda, M.1    Kojima, M.2    Murota, K.3    Nakata, K.4
  • 4
    • 0034415006 scopus 로고    scopus 로고
    • A spectral bundle method for semidefinite programming
    • C. Helmberg and F. Rendl (2000). A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673-696.
    • (2000) SIAM Journal on Optimization , vol.10 , pp. 673-696
    • Helmberg, C.1    Rendl, F.2
  • 5
    • 0036455609 scopus 로고    scopus 로고
    • Second order cone programming relaxations of quadratic optimization problems
    • S. Kim and M. Kojima (2001). Second order cone programming relaxations of quadratic optimization problems. Optimization Methods and Software, 15, 201-224.
    • (2001) Optimization Methods and Software , vol.15 , pp. 201-224
    • Kim, S.1    Kojima, M.2
  • 6
    • 3242780054 scopus 로고    scopus 로고
    • Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations
    • 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
    • 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.
    • (2002) Research Report , vol.B-375
    • Kim, S.1    Kojima, M.2
  • 7
    • 0242592654 scopus 로고    scopus 로고
    • A general framework for convex relaxation of polynomial optimization problems over cones
    • 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.
    • (2003) Journal of Operation Research Society of Japan , vol.46 , Issue.2 , pp. 125-144
    • Kojima, M.1    Kim, S.2    Waki, H.3
  • 8
    • 0041940559 scopus 로고    scopus 로고
    • Applications of second-order cone programming
    • Special Issue on Linear Algebra in Control, Signals and Image Processing.
    • 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.
    • (1998) Linear Algebra and its Applications , vol.284 , pp. 193-228
    • Lobo, M.1    Vandenberghe, L.2    Boyd, S.3    Lebret, H.4
  • 9
    • 0242324790 scopus 로고    scopus 로고
    • A new second order cone programming relaxation for Max-cut problems
    • 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.
    • (2003) Journal of Operation Research Society of Japan , vol.46 , Issue.2 , pp. 164-177
    • Muramatsu, M.1    Suzuki, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.