LMI Approximations for Cones of Positive Semidefinite Forms
From MaRDI portal
Recommendations
Cited in
(31)- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Optimization over structured subsets of positive semidefinite matrices via column generation
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Strong duality and minimal representations for cone optimization
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- Alternative SDP and SOCP approximations for polynomial optimization
- Completely positive reformulations for polynomial optimization
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A dynamic inequality generation scheme for polynomial programming
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Moment approximations for set-semidefinite polynomials
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Representing quadratically constrained quadratic programs as generalized copositive programs
- scientific article; zbMATH DE number 7313221 (Why is no real title available?)
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Generalizations of doubly nonnegative cones and their comparison
- Computational complexity of sum-of-squares bounds for copositive programs
- Copositive matrices, sums of squares and the stability number of a graph
- Non-facial exposedness of copositive cones over symmetric cones
- A linear programming reformulation of the standard quadratic optimization problem
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Exploiting equalities in polynomial programming
This page was built for publication: LMI Approximations for Cones of Positive Semidefinite Forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470233)
