Title
A note on treating a second order cone program as a special case of a semidefinite program
Abstract
It is well known that a vector is in a second order cone if and only if its “arrow” matrix is positive semidefinite. But much less well-known is about the relation between a second order cone program (SOCP) and its corresponding semidefinite program (SDP). The correspondence between the dual problem of SOCP and SDP is quite direct and the correspondence between the primal problems is much more complicated. Given a SDP primal optimal solution which is not necessarily “arrow-shaped”, we can construct a SOCP primal optimal solution. The mapping from the primal optimal solution of SDP to the primal optimal solution of SOCP can be shown to be unique. Conversely, given a SOCP primal optimal solution, we can construct a SDP primal optimal solution which is not an “arrow” matrix. Indeed, in general no primal optimal solutions of the SOCP-related SDP can be an “arrow” matrix.
Year
DOI
Venue
2005
10.1007/s10107-004-0546-3
Math. Program.
Keywords
Field
DocType
dual problem,special case,primal problem,order cone program,sdp primal optimal solution,socp-related sdp,primal optimal solution,socp primal optimal solution,order cone,corresponding semidefinite program,positive semidefinite
Mathematical optimization,Arrow,Matrix (mathematics),Positive-definite matrix,Duality (optimization),If and only if,Semidefinite programming,Mathematics,Special case
Journal
Volume
Issue
ISSN
102
3
1436-4646
Citations 
PageRank 
References 
3
0.49
4
Authors
2
Name
Order
Citations
PageRank
Chee-Khian Sim1235.43
Gongyun Zhao215415.68