All saddle points for polynomial optimization
From MaRDI portal
Cites work
- 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 2121575 (Why is no real title available?)
- A Sum-of-Squares Approach to Fixed-Order H∞-Synthesis
- 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
- 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
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Finite approximation to a zero-sum game with incomplete information
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
- Local saddle points for unconstrained polynomial optimization
- Min-max and robust polynomial optimization
- Non-cooperative games
- On the complexity of computing critical points with Gröbner bases
- Optimal primal-dual methods for a class of saddle point problems
- Parameter selection for total-variation-based image restoration using discrepancy principle
- Polynomial optimization with real varieties
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Pure states, positive matrix polynomials and sums of Hermitian squares
- Robust optimization
- Saddle points of rational functions
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Semidefinite programming for min-max problems and games
- Semidefinite programming relaxations for semialgebraic problems
- Subgradient method to find the saddle point of a convex-concave function
- Subgradient methods for saddle-point problems
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- The hierarchy of local minimums in polynomial optimization
- The saddle point problem of polynomials
- 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
This page was built for publication: All saddle points for polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006137)
