Sparsity in sums of squares of polynomials
From MaRDI portal
Recommendations
- Sums of squares and sparse semidefinite programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- A note on the representation of positive polynomials with structured sparsity
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Cites work
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- An algorithm for sums of squares of real polynomials
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Class of global minimum bounds of polynomial functions
- Extremal psd forms with few terms
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Linear Matrix Inequalities in System and Control Theory
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite programming relaxations for semialgebraic problems
Cited in
(53)- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Recognizing underlying sparsity in optimization
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Set-membership errors-in-variables identification of MIMO linear systems
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Sparse shifts for univariate polynomials
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Newton polytopes and relative entropy optimization
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- One-shot set-membership identification of generalized Hammerstein-Wiener systems
- Alternative SDP and SOCP approximations for polynomial optimization
- Sparsity of integer solutions in the average case
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Approximate gcds of polynomials and sparse SOS relaxations
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- A note on the representation of positive polynomials with structured sparsity
- Global minimization of rational functions and the nearest GCDs
- Solving polynomial least squares problems via semidefinite programming relaxations
- Reference dependent invariant sets: sum of squares based computation and applications in constrained control
- Sparse squares of polynomials
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- Polynomial sum of squares in fluid dynamics: a review with a look ahead
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Polynomials whose powers are sparse
- SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
- Facial reduction algorithms for conic optimization problems
- LP formulations for polynomial optimization problems
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Sums of squares and sparse semidefinite programming
- An algorithm for sums of squares of a class of positive semi-definite polynomials
- A unified framework of SAGE and SONC polynomials and its duality theory
- Algebraic Perspectives on Signomial Optimization
- Sums of Separable and Quadratic Polynomials
- A facial reduction algorithm for finding sparse SOS representations
- Complexity of sparse polynomial solving 2: renormalization
- A Sparse Version of Reznick’s Positivstellensatz
- The moment-SOS hierarchy: applications and related topics
- Distributed nonlinear conic optimization with partially separable structure
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- A polynomial optimization approach to constant rebalanced portfolio selection
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- Smaller SDP for SOS decomposition
- Sum of squares method for sensor network localization
- On the complexity of Putinar's Positivstellensatz
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Positive polynomials on projective limits of real algebraic varieties
This page was built for publication: Sparsity in sums of squares of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777218)
