Abstract
The positive semidefinite constraint for the variable matrix in semidefinite programming (SDP) relaxation is further relaxed by a finite number of second order cone constraints in second order cone programming (SOCP) relaxations. A few types of SOCP relaxations are obtained from different ways of expressing the positive semidefinite constraint of the SDP relaxation. We present how such SOCP relaxations can be derived, and show the relationship between the resulting SOCP relaxations.
Original language | English |
---|---|
Pages (from-to) | 535-541 |
Number of pages | 7 |
Journal | Optimization Methods and Software |
Volume | 18 |
Issue number | 5 |
DOIs | |
State | Published - Oct 2003 |
Keywords
- Convex relaxation
- Nonconvex program
- Quadratic program
- Second order cone program
- Semidefinite program