Pages that link to "Item:Q879967"

The following pages link to An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967):

Displaying 24 items.

• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932) (← links)
• Derivatives of eigenvalues and Jordan frames (Q317127) (← links)
• Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
• Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
• Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones (Q996334) (← links)
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
• A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
• An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
• Matrix sum-of-squares relaxations for robust semi-definite programs (Q2492689) (← links)
• Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
• Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
• Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
• (Q3621141) (← links)
• A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES (Q4446317) (← links)
• An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization (Q5169658) (← links)
• Robust stability, ℋ₂ analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix (Q5323242) (← links)
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
• Sum of squares generalizations for conic sets (Q6038674) (← links)