LMI Approximations for Cones of Positive Semidefinite Forms
From MaRDI portal
Publication:5470233
DOI10.1137/03060151XzbMath1131.90040OpenAlexW2124038748WikidataQ58051179 ScholiaQ58051179MaRDI QIDQ5470233
Luis F. Zuluaga, Juan Carlos Vera, Javier F. Peña
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/03060151x
global optimizationlinear matrix inequalitiessemidefinite programmingpositive polynomialsconic programming
Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Related Items
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A linear programming reformulation of the standard quadratic optimization problem, Interplay of non-convex quadratically constrained problems with adjustable robust optimization, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Strong duality and minimal representations for cone optimization, Approximation hierarchies for copositive cone over symmetric cone and their comparison, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Representing quadratically constrained quadratic programs as generalized copositive programs, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Exploiting equalities in polynomial programming, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides, Adaptive computable approximation to cones of nonnegative quadratic functions, A PTAS for the minimization of polynomials of fixed degree over the simplex, Alternative SDP and SOCP approximations for polynomial optimization, Completely positive reformulations for polynomial optimization, Exploiting symmetry in copositive programs via semidefinite hierarchies, A dynamic inequality generation scheme for polynomial programming
