Pages that link to "Item:Q5470233"

The following pages link to LMI Approximations for Cones of Positive Semidefinite Forms (Q5470233):

Displaying 19 items.

• A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
• A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
• Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
• Exploiting equalities in polynomial programming (Q935230) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
• Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)