Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
From MaRDI portal
Publication:3451759
DOI10.1137/140992047zbMath1327.14241arXiv1507.06143OpenAlexW2131315471MaRDI QIDQ3451759
Victor Magron, Didier Henrion, Jean-Bernard Lasserre
Publication date: 18 November 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06143
Convex programming (90C25) Sums of squares and representations by other particular quadratic forms (11E25) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10)
Related Items
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, A Matrix Positivstellensatz with Lifting Polynomials, Operator systems and convex sets with many normal cones, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, ParetoImageSDP, Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems, On the existence of Pareto solutions for polynomial vector optimization problems, Volume of Sublevel Sets of Homogeneous Polynomials, Existence of Pareto solutions for vector polynomial optimization problems with constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variant quantifier elimination
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Representing polynomials by positive linear functions on compact convex polyhedra
- Solving systems of polynomial inequalities in subexponential time
- Approximating Pareto curves using semidefinite relaxations
- Tractable approximations of sets defined with quantifiers
- A “Joint+Marginal” Approach to Parametric Polynomial Optimization
- Vector Optimization
- Positivity and Optimization for Semi-Algebraic Functions
- Approximate Volume and Integration for Basic Semialgebraic Sets
- Generalizations of Farkas’ Theorem
- On the combinatorial and algebraic complexity of quantifier elimination
- Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Algorithms in real algebraic geometry
- Efficient Pareto frontier exploration using surrogate approximations
