The saddle point problem of polynomials
From MaRDI portal
Publication:2162120
DOI10.1007/s10208-021-09526-8zbMath1496.90052arXiv1809.01218OpenAlexW3177747327MaRDI QIDQ2162120
Guangming Zhou, Zi Yang, Jia-Wang Nie
Publication date: 5 August 2022
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.01218
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)
Related Items
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Convex generalized Nash equilibrium problems and polynomial optimization, Saddle points of rational functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Variant quantifier elimination
- The truncated moment problem via homogenization and flat extensions
- Min-max and robust polynomial optimization
- Semidefinite programming for min-max problems and games
- Linear optimization with cones of moments and nonnegative polynomials
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Subgradient methods for saddle-point problems
- Real quantifier elimination is doubly exponential
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- An interior-point method for a class of saddle-point problems
- Semidefinite programming relaxations for semialgebraic problems
- A semidefinite approach for truncated \(K\)-moment problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Generating polynomials and symmetric tensor decompositions
- Certifying convergence of Lasserre's hierarchy via flat truncation
- There are significantly more nonnegative polynomials than sums of squares
- Non-cooperative games
- Global Optimization with Polynomials and the Problem of Moments
- Polynomial Optimization with Real Varieties
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- An Introduction to Polynomial and Semi-Algebraic Optimization
- On the Complexity of Computing Critical Points with Gröbner Bases
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Robust Optimization for Unconstrained Simulation-Based Problems
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Semidefinite optimization
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Semidefinite Optimization and Convex Algebraic Geometry
- THE MOMENT-SOS HIERARCHY
- Algebraic Degree of Polynomial Optimization
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Algorithms in real algebraic geometry
