Pages that link to "Item:Q1777218"

The following pages link to Sparsity in sums of squares of polynomials (Q1777218):

Displaying 34 items.

• Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
• Facial reduction algorithms for conic optimization problems (Q368590) (← links)
• A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces (Q693193) (← links)
• A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
• Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
• Smaller SDP for SOS decomposition (Q746820) (← links)
• Sum of squares method for sensor network localization (Q839485) (← links)
• On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
• Positive polynomials on projective limits of real algebraic varieties (Q998968) (← links)
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
• Recognizing underlying sparsity in optimization (Q1013977) (← links)
• Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
• A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
• Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
• One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
• Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
• Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
• Reference dependent invariant sets: sum of squares based computation and applications in constrained control (Q2665114) (← 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)
• Polynomial sum of squares in fluid dynamics: a review with a look ahead (Q2955676) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)