On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
DOI10.1007/s10589-020-00168-0zbMath1441.90167arXiv1812.10987OpenAlexW3001014918WikidataQ126314623 ScholiaQ126314623MaRDI QIDQ2307704
Publication date: 25 March 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10987
polynomial optimizationsum of squaresconvex polynomialssemidefinite programming relaxationssemi-infinite systemssemidefinite representations
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Semi-infinite programming (90C34) Polynomial optimization (90C23)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Discriminants and nonnegative polynomials
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- Semi-infinite programming
- On the complexity of Putinar's Positivstellensatz
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- A semidefinite programming approach to the generalized problem of moments
- An algorithm for the global optimization of a class of continuous minimax problems
- Exponentially bounded positive definite functions
- The \(K\)-moment problem for compact semi-algebraic sets
- Quadratic programming with one negative eigenvalue is NP-hard
- Recent contributions to linear semi-infinite optimization
- An algorithm for semi-infinite polynomial optimization
- NP-hardness of deciding convexity of quartic polynomials and related problems
- An exact Jacobian SDP relaxation for polynomial optimization
- Tractable approximations of sets defined with quantifiers
- Convex sets with semidefinite representation
- Semidefinite relaxations for semi-infinite polynomial programming
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Theta Bodies for Polynomial Ideals
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Direct theorems in semi-infinite convex programming
- Polynomials that are positive on an interval
- On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets
- Spectrahedral Shadows
- On solving a class of linear semi-infinite programming by SDP method
- Algebraic Degree of Polynomial Optimization
- Semidefinite Representations of Noncompact Convex Sets
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- On the Momentum Problem for Distribution Functions in More than One Dimension
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
