Convexity in SemiAlgebraic Geometry and Polynomial Optimization
From MaRDI portal
Abstract: We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for polynomial optimization simplifies and has finite convergence, a highly desirable feature as convex problems are in principle easier to solve. In addition, if a basic semi-algebraic set K is convex but its defining polynomials are not, we provide a certificate of convexity if a sufficient (and almost necessary) condition is satified. This condition can be checked numerically and also provides a new condition for K to have semidefinite representation. For this we use (and extend) some of recent results from the author and Helton and Nie. Finally, we show that when restricting to a certain class of convex polynomials, the celebrated Jensen's inequality in convex analysis can be extended to linear functionals that are not necessarily probability measures.
Recommendations
- Convexifying positive polynomials and sums of squares approximation
- Certificates of convexity for basic semi-algebraic sets
- Representation of nonnegative convex polynomials
- Optimization of Polynomials on Compact Semialgebraic Sets
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
Cited in
(67)- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- A multilevel analysis of the Lasserre hierarchy
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- DC decomposition of nonconvex polynomials with algebraic techniques
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- NP-hardness of deciding convexity of quartic polynomials and related problems
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Distributionally robust optimization with moment ambiguity sets
- New examples of extremal positive linear maps
- On solving a class of fractional semi-infinite polynomial programming problems
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- A bounded degree SOS hierarchy for polynomial optimization
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Reinhardt free spectrahedra
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
- Convex generalized Nash equilibrium problems and polynomial optimization
- Introduction to semidefinite, conic and polynomial optimization
- Semidefinite Representation of Convex Sets and Convex Hulls
- Convex hulls of algebraic sets
- Positive maps and separable matrices
- Convex hulls of quadratically parameterized sets with quadratic constraints
- Theta bodies for polynomial ideals
- Robust quadratic programming with mixed-integer uncertainty
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- Improved Conic Reformulations for $K$-means Clustering
- Free semidefinite representation of matrix power functions
- ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Exact conic programming relaxations for a class of convex polynomial cone programs
- Total variation isoperimetric profiles
- A matrix Positivstellensatz with lifting polynomials
- Stochastic polynomial optimization
- Homogenization for polynomial optimization with unbounded sets
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Sum-of-squares relaxations in robust DC optimization and feature selection
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
- The moment-SOS hierarchy: applications and related topics
- Higher-order Newton methods with polynomial work per iteration
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Robust approximation of chance constrained optimization with polynomial perturbation
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- A characterization for tightness of the sparse moment-SOS hierarchy
- Finite convergence of the moment-SOS hierarchy for polynomial matrix optimization
- Optimal transport-based distributionally robust optimization with polynomial uncertainty
- Convex ternary quartics are SOS-convex
- Distributionally robust optimization with polynomial robust constraints
- A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
- On the complexity of matrix Putinar's Positivstellensätz
- Piecewise SOS-convex moment optimization and applications via exact semi-definite programs
- A convex polynomial that is not sos-convex
- SPLD polynomial optimization and bounded degree SOS hierarchies
- Convergent lifted Lasserre hierarchy of SDPs for minimizing expectation of piecewise polynomial loss over Wasserstein balls
- Lagrange multiplier expressions for matrix polynomial optimization and tight relaxations
- Sparse polynomial optimization with matrix constraints
- Linear optimization with cones of moments and nonnegative polynomials
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Certificates of convexity for basic semi-algebraic sets
This page was built for publication: Convexity in SemiAlgebraic Geometry and Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648539)
