Tight relaxations for polynomial optimization and Lagrange multiplier expressions
From MaRDI portal
Publication:2330641
DOI10.1007/s10107-018-1276-2zbMath1461.65179arXiv1701.01549OpenAlexW2963627984WikidataQ129953487 ScholiaQ129953487MaRDI QIDQ2330641
Publication date: 22 October 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.01549
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)
Related Items (16)
Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Positivity certificates and polynomial optimization on non-compact semialgebraic sets ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ The saddle point problem of polynomials ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ Dehomogenization for completely positive tensors ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Rational Generalized Nash Equilibrium Problems ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ Hausdorff distance between convex semialgebraic sets ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ An SDP method for copositivity of partially symmetric tensors ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ Saddle points of rational functions
Uses Software
Cites Work
- Minimizing the sum of many rational functions
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Discriminants and nonnegative polynomials
- Linear optimization with cones of moments and nonnegative polynomials
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite representations for finite varieties
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- An exact Jacobian SDP relaxation for polynomial optimization
- A bounded degree SOS hierarchy for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Global minimization of rational functions and the nearest GCDs
- Global optimization of rational functions: a semidefinite programming approach
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Polynomial Optimization with Real Varieties
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Sharp Effective Nullstellensatz
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tight relaxations for polynomial optimization and Lagrange multiplier expressions
