A Facial Reduction Algorithm for Finding Sparse SOS Representations
Hayato Waki (wakics.uec.ac.jp)
Abstract: Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial () 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.
Keywords: Semidefinite Programming, Polynomial Optimization Problems, Facial Reduction Algorithms, Sum of Squares.
Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )
Category 2: Global Optimization (Theory )
Category 3: Convex and Nonsmooth Optimization (Convex Optimization )
Citation: Technical Report CS-09-02, Department of Computer Science, The University of Electro-Communications.
Entry Submitted: 11/04/2009
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|