DSpace at EWHA: Second order cone programming relaxation of a positive semidefinite constraint

View : 614 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	김선영	*
dc.date.accessioned	2016-08-28T11:08:31Z	-
dc.date.available	2016-08-28T11:08:31Z	-
dc.date.issued	2003	*
dc.identifier.issn	1055-6788	*
dc.identifier.other	OAK-1720	*
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/219333	-
dc.description.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.	*
dc.language	English	*
dc.title	Second order cone programming relaxation of a positive semidefinite constraint	*
dc.type	Article	*
dc.relation.issue	5	*
dc.relation.volume	18	*
dc.relation.index	SCIE	*
dc.relation.index	SCOPUS	*
dc.relation.startpage	535	*
dc.relation.lastpage	541	*
dc.relation.journaltitle	Optimization Methods and Software	*
dc.identifier.doi	10.1080/1055678031000148696	*
dc.identifier.wosid	WOS:000186543800002	*
dc.identifier.scopusid	2-s2.0-0242695798	*
dc.author.google	Kim S.	*
dc.author.google	Kojima M.	*
dc.author.google	Yamashita M.	*
dc.contributor.scopusid	김선영(57221275622)	*
dc.date.modifydate	20231116113048	*