Sciweavers

ORL
2010

A facial reduction algorithm for finding sparse SOS representations

13 years 10 months ago
A facial reduction algorithm for finding sparse SOS representations
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for an SOS representation. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial. Key words: Facial Reduction Algorithm, Semidefinite Programming, Polynomial Optimization.
Hayato Waki, Masakazu Muramatsu
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where ORL
Authors Hayato Waki, Masakazu Muramatsu
Comments (0)