A facial reduction algorithm for finding sparse SOS representations
From MaRDI portal
Recommendations
- A Sparsity-Enforcing Method for Learning Face Features
- A facial reduction approach for the single source localization problem
- Sparsity preserving projections with applications to face recognition
- Structure-Preserving Sparse Decomposition for Facial Expression Analysis
- Sparse representation for face recognition based on constraint sampling and face alignment
Cites work
- An algorithm for sums of squares of real polynomials
- Extremal psd forms with few terms
- Facial reduction algorithms for conic optimization problems
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3728055 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Regularizing the abstract convex program
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Strong Duality for Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(12)- A relaxed-certificate facial reduction algorithm based on subspace intersection
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Chordal graphs in triangular decomposition in top-down style
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- An extension of the elimination method for a sparse SOS polynomial
- Facial reduction algorithms for conic optimization problems
- Facially dual complete (nice) cones and lexicographic tangents
- Validating numerical semidefinite programming solvers for polynomial invariants
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Smaller SDP for SOS decomposition
This page was built for publication: A facial reduction algorithm for finding sparse SOS representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613325)
