Polynomial optimization with real varieties
From MaRDI portal
Abstract: We consider the optimization problem of minimizing a polynomial f(x) subject to polynomial constraints h(x)=0, g(x)>=0. Lasserre's hierarchy is a sequence of sum of squares relaxations for finding the global minimum. Let K be the feasible set. We prove the following results: i) If the real variety V_R(h) is finite, then Lasserre's hierarchy has finite convergence, no matter the complex variety V_C(h) is finite or not. This solves an open question in Laurent's survey. ii) If K and V_R(h) have the same vanishing ideal, then the finite convergence of Lasserre's hierarchy is independent of the choice of defining polynomials for the real variety V_R(h). iii) When K is finite, a refined version of Lasserre's hierarchy (using the preordering of g) has finite convergence.
Recommendations
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Optimization of Polynomials on Compact Semialgebraic Sets
Cited in
(55)- Continuous optimization problems and a polynomial hierarchy of real functions
- Tensor eigenvalue complementarity problems
- Real eigenvalues of nonsymmetric tensors
- Tensor maximal correlation problems
- An SDP method for copositivity of partially symmetric tensors
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Solving the equality-constrained minimization problem of polynomial functions
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- Tensor \(Z\)-eigenvalue complementarity problems
- An efficient alternating minimization method for fourth degree polynomial optimization
- Local saddle points for unconstrained polynomial optimization
- The saddle point problem of polynomials
- Quadrature-based polynomial optimization
- A semidefinite relaxation method for second-order cone polynomial complementarity problems
- Higher-degree tensor eigenvalue complementarity problems
- Saddle points of rational functions
- Test of copositive tensors
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- The hierarchy of local minimums in polynomial optimization
- A new approximation hierarchy for polynomial conic optimization
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
- Quadratic tensor eigenvalue complementarity problems
- Convex generalized Nash equilibrium problems and polynomial optimization
- Positive maps and separable matrices
- Optimizing a linear function over a noncompact real algebraic variety
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Real radicals and finite convergence of polynomial optimization problems
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Unconstrained Optimization of Real Functions in Complex Variables
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Stochastic polynomial optimization
- Optimization of Polynomials on Compact Semialgebraic Sets
- A semidefinite method for tensor complementarity problems
- Well-posedness in unconstrained polynomial optimization problems
- The maximum tensor complementarity eigenvalues
- Homogenization for polynomial optimization with unbounded sets
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- The multivariate eigenvalues of symmetric tensors
- A polynomial optimization framework for polynomial quasi-variational inequalities with moment-SOS relaxations
- On the hardness of deciding the finite convergence of Lasserre hierarchies
- A characterization for tightness of the sparse moment-SOS hierarchy
- Finite convergence of the moment-SOS hierarchy for polynomial matrix optimization
- Polynomial optimization over unions of sets
- Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition
- All saddle points for polynomial optimization
- Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
- Exact moment representation in polynomial optimization
- The rank-1 completion problem for cubic tensors
- Generalized Nash equilibrium problems with quasi-linear constraints
- Equality-constrained minimization of polynomial functions
This page was built for publication: Polynomial optimization with real varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866200)
