The saddle point problem of polynomials
From MaRDI portal
Publication:2162120
Abstract: This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining polynomials, we show that: i) if there exists a saddle point, our algorithm can get one by solving a finite number of Lasserre type semidefinite relaxations; ii) if there is no saddle point, our algorithm can detect its nonexistence.
Recommendations
- Anti-saddles of a polynomial system
- Saddle point theorems
- scientific article; zbMATH DE number 4037616
- An extremal problem for polynomials
- An extremal problem for polynomials
- An extremal problem for polynomials
- An Extremal Problem for Polynomials
- scientific article; zbMATH DE number 3914890
- An Extremal Problem for Polynomials
- scientific article; zbMATH DE number 3861716
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A semidefinite approach for truncated \(K\)-moment problems
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- Algebraic degree of polynomial optimization
- Algorithms in real algebraic geometry
- An interior-point method for a class of saddle-point problems
- An introduction to polynomial and semi-algebraic optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- 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
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Generating polynomials and symmetric tensor decompositions
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- scientific article; zbMATH DE number 4167867 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 706270 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Linear optimization with cones of moments and nonnegative polynomials
- Min-max and robust polynomial optimization
- Non-cooperative games
- On the complexity of computing critical points with Gröbner bases
- 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
- Optimal primal-dual methods for a class of saddle point problems
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization over polynomials: selected topics
- Polynomial optimization with real varieties
- Positivity and sums of squares: a guide to recent results
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Real quantifier elimination is doubly exponential
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Robust optimization for unconstrained simulation-based problems
- Semidefinite optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite programming for min-max problems and games
- Semidefinite programming relaxations for semialgebraic problems
- Subgradient methods for saddle-point problems
- Sums of squares, moment matrices and optimization over polynomials
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- The moment-SOS hierarchy
- The truncated moment problem via homogenization and flat extensions
- There are significantly more nonnegative polynomials than sums of squares
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variant quantifier elimination
Cited in
(13)- Local saddle points for unconstrained polynomial optimization
- Saddle points and overdetermined complex equations
- Saddle points of rational functions
- Convex generalized Nash equilibrium problems and polynomial optimization
- scientific article; zbMATH DE number 4190064 (Why is no real title available?)
- Apéry polynomials and the multivariate saddle point method
- scientific article; zbMATH DE number 7313221 (Why is no real title available?)
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Stochastic Saddle Point Problems with Decision-Dependent Distributions
- Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems
- A polynomial optimization framework for polynomial quasi-variational inequalities with moment-SOS relaxations
- All saddle points for polynomial optimization
- Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
This page was built for publication: The saddle point problem of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2162120)
