DSpace at EWHA: Sparsity in sums of squares of polynomials

View : 525 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	김선영	*
dc.date.accessioned	2018-05-18T08:15:05Z	-
dc.date.available	2018-05-18T08:15:05Z	-
dc.date.issued	2005	*
dc.identifier.issn	0025-5610	*
dc.identifier.other	OAK-2750	*
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/243129	-
dc.description.abstract	Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and semidefinite programming (SDP) relaxation of polynomial optimization problems. We discuss effective methods to obtain a simpler representation of a "sparse" polynomial as a sum of squares of sparse polynomials by eliminating redundancy. ©2004 Springer-Verlag.	*
dc.language	English	*
dc.title	Sparsity in sums of squares of polynomials	*
dc.type	Article	*
dc.relation.issue	1	*
dc.relation.volume	103	*
dc.relation.index	SCI	*
dc.relation.index	SCIE	*
dc.relation.index	SCOPUS	*
dc.relation.startpage	45	*
dc.relation.lastpage	62	*
dc.relation.journaltitle	Mathematical Programming	*
dc.identifier.doi	10.1007/s10107-004-0554-3	*
dc.identifier.wosid	WOS:000229477200003	*
dc.identifier.scopusid	2-s2.0-17444428545	*
dc.author.google	Kojima M.	*
dc.author.google	Kim S.	*
dc.author.google	Waki H.	*
dc.contributor.scopusid	김선영(57221275622)	*
dc.date.modifydate	20231116113048	*