View : 16 Download: 0

Second order cone programming relaxation of a positive semidefinite constraint

Title
Second order cone programming relaxation of a positive semidefinite constraint
Authors
Kim S.Kojima M.Yamashita M.
Ewha Authors
김선영
SCOPUS Author ID
김선영scopus
Issue Date
2003
Journal Title
Optimization Methods and Software
ISSN
1055-6788JCR Link
Citation
vol. 18, no. 5, pp. 535 - 541
Indexed
SCIE; SCOPUS WOS scopus
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.
DOI
10.1080/1055678031000148696
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE