A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
From MaRDI portal
Publication:6136658
DOI10.1137/22m1515689arXiv2208.03979OpenAlexW4390613906MaRDI QIDQ6136658
Publication date: 17 January 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.03979
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Polynomial optimization (90C23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Linear optimization with cones of moments and nonnegative polynomials
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- The saddle point problem of polynomials
- The geometry of SDP-exactness in quadratic optimization
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Certifying convergence of Lasserre's hierarchy via flat truncation
- A note on the representation of positive polynomials with structured sparsity
- Minimizing polynomials via sum of squares over the gradient ideal
- Convex generalized Nash equilibrium problems and polynomial optimization
- Global Optimization with Polynomials and the Problem of Moments
- Polynomial Optimization with Real Varieties
- An Introduction to Polynomial and Semi-Algebraic Optimization
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- Sparse Polynomial Optimization
- THE MOMENT-SOS HIERARCHY
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Sparse polynomial optimisation for neural network verification
- Moment and Polynomial Optimization
This page was built for publication: A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
