Sampling Algebraic Varieties for Sum of Squares Programs

DOI10.1137/15M1052548zbMath1386.90099arXiv1511.06751OpenAlexW2172384618MaRDI QIDQ4594913

Diego Cifuentes, Pablo A. Parrilo

Publication date: 27 November 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.06751

zbMATH Keywords

samplingnumerical algebraic geometrysum of squaresSDPalgebraic variety

Mathematics Subject Classification ID

Semidefinite programming (90C22) Numerical computation of solutions to systems of equations (65H10)

Related Items

On the local stability of semidefinite relaxations ⋮ Stability analysis of complementarity systems with neural network controllers ⋮ Certified Hermite matrices from approximate roots ⋮ Low-Rank Univariate Sum of Squares Has No Spurious Local Minima ⋮ A hybrid procedure for finding real points on a real algebraic set ⋮ On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems ⋮ Learning algebraic varieties from samples ⋮ Certifying Polynomial Nonnegativity via Hyperbolic Optimization ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix

Uses Software

• Macaulay2
• PHCpack
• SDPT3
• DSDP5
• Bertini

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• Sums of squares and varieties of minimal degree
• Polynomial Interpolation in Several Variables: Lattices, Differences, and Ideals
• Une majoration de la fonction de Hilbert et ses conséquences pour l'interpolation algébrique
• Algorithm 875
• On the ideals and singularities of secant varieties of Segre varieties
• Progress on Polynomial Identity Testing - II
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Algorithm 795
• Semidefinite Optimization and Convex Algebraic Geometry
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
• Approximating amoebas and coamoebas by sums of squares
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• Derandomizing polynomial identity tests means proving circuit lower bounds