Exploiting Algebraic Structure in Sum of Squares Programs

DOI10.1007/10997703_11zbMath1070.90081OpenAlexW2498847617MaRDI QIDQ4681654

Pablo A. Parrilo

Publication date: 24 June 2005

Published in: Positive Polynomials in Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/10997703_11

zbMATH Keywords

algebraic structuresemidefinite programssquares decomposition

Mathematics Subject Classification ID

Related Items (12)

Sum of squares method for sensor network localization ⋮ Gram determinants of real binary tensors ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Sums of squares in Macaulay2 ⋮ Approximating Nonnegative Polynomials via Spectral Sparsification ⋮ Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system ⋮ Nonstationary LPV control for trajectory tracking: a double pendulum example ⋮ Simple approximations of semialgebraic sets and their applications to control ⋮ A convex polynomial that is not sos-convex ⋮ Sums of squares over totally real fields are rational sums of squares ⋮ Approximating amoebas and coamoebas by sums of squares ⋮ Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems

Uses Software

• Sostools

This page was built for publication: Exploiting Algebraic Structure in Sum of Squares Programs