Exploiting Algebraic Structure in Sum of Squares Programs
From MaRDI portal
Recommendations
- Symmetry groups, semidefinite programs, and sums of squares
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Smaller SDP for SOS decomposition
- Semidefinite programming relaxations and algebraic optimization in control
- Exploiting special structure in semidefinite programming: a survey of theory and applications
Cited in
(19)- Nonstationary LPV control for trajectory tracking: a double pendulum example
- Sums of squares in Macaulay2
- Approximating amoebas and coamoebas by sums of squares
- Approximating nonnegative polynomials via spectral sparsification
- Sampling algebraic varieties for sum of squares programs
- Sums of squares over totally real fields are rational sums of squares
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- A convex polynomial that is not sos-convex
- A linear algebra method to decompose forms whose length is lower than the number of variables into weighted sum of squares
- Gram determinants of real binary tensors
- Sum of squares method for sensor network localization
- Symmetry groups, semidefinite programs, and sums of squares
- Sparse polynomial matrix optimization
- Smaller SDP for SOS decomposition
- Certifying the global optimality of quartic minimization over the sphere
- On the complexity of SOS programming and applications in control systems
- Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
- Peak estimation of rational systems using convex optimization
- Simple approximations of semialgebraic sets and their applications to control
This page was built for publication: Exploiting Algebraic Structure in Sum of Squares Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681654)
