Local saddle points for unconstrained polynomial optimization
From MaRDI portal
Publication:2125068
DOI10.1007/s10589-022-00361-3zbMath1490.90217OpenAlexW4220897274MaRDI QIDQ2125068
Publication date: 12 April 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00361-3
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35) Polynomial optimization (90C23)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The truncated moment problem via homogenization and flat extensions
- Linear optimization with cones of moments and nonnegative polynomials
- Preconditioners for saddle point linear systems with highly singular \((1,1)\) blocks
- Finite approximation to a zero-sum game with incomplete information
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Subgradient methods for saddle-point problems
- Optimization of the Hermitian and skew-Hermitian splitting iteration for saddle-point problems
- An extragradient method for finding the saddle point in an optimal control problem
- An exact Jacobian SDP relaxation for polynomial optimization
- Saddle points of rational functions
- The hierarchy of local minimums in polynomial optimization
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Polynomial Optimization with Real Varieties
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Pure states, positive matrix polynomials and sums of hermitian squares
- GloptiPoly 3: moments, optimization and semidefinite programming
- Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems
- Essentials of Game Theory: A Concise Multidisciplinary Introduction
- Some NP-complete problems in quadratic and nonlinear programming
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point 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
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- A Class of Nonsymmetric Preconditioners for Saddle Point Problems
This page was built for publication: Local saddle points for unconstrained polynomial optimization
