Polynomial optimization, sums of squares, and applications
From MaRDI portal
Publication:2978415
Recommendations
- Moments and sums of squares for polynomial optimization and related problems
- Certificates of positivity for real polynomials. Theory, practice, and applications
- Positive polynomials and semidefinite programming
- Positive polynomials and sums of squares: theory and practice
- Optimization over polynomials: selected topics
Cited in
(41)- A study of the double pendulum using polynomial optimization
- Semidefinite program duals for separable polynomial programs involving box constraints
- Minimum wave speeds in monostable reaction-diffusion equations: sharp bounds by polynomial optimization
- scientific article; zbMATH DE number 4141790 (Why is no real title available?)
- A complete characterization of the gap between convexity and sos-convexity
- Nonnegative polynomials and sums of squares
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- Bounding extrema over global attractors using polynomial optimisation
- Hybrid Systems: Computation and Control
- Global minimization of polynomial integral functionals
- Positive polynomials and semidefinite programming
- A brief introduction to sums of squares
- Applications of sums of squares
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Optimization via Chebyshev polynomials
- Convex computation of maximal Lyapunov exponents
- Polynomial hulls and an optimization problem
- Quantile-constrained Wasserstein projections for robust interpretability of numerical and machine learning models
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- Analysis of optimization algorithms via sum-of-squares
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Moments and sums of squares for polynomial optimization and related problems
- Symmetry adapted Gram spectrahedra
- Robust control of uncertain systems: classical results and recent developments
- Approximation Methods for Polynomial Optimization
- Certificates of positivity for real polynomials. Theory, practice, and applications
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
- Sum of squares: theory and applications. AMS short course, Baltimore, MD, USA, January 14--15, 2019
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Univariate polynomial optimization with sum-of-squares interpolants
- Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization
- Logical Approaches to Computational Barriers
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- On sums of squares of \(K\)-nomials
- Sums of squares and sparse semidefinite programming
- Rational quartic spectrahedra
This page was built for publication: Polynomial optimization, sums of squares, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978415)
