Saddle points of rational functions
From MaRDI portal
Recommendations
- The saddle point problem of polynomials
- Local saddle points for unconstrained polynomial optimization
- Finite algorithm to find the saddle point of a quadratic function subject to linear constraints
- A two-level subgradient method for finding saddle points of convex- concave functions
- scientific article; zbMATH DE number 4049432
Cites work
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- Algebraic degree of polynomial optimization
- 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
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Global minimization of rational functions and the nearest GCDs
- Global optimization of rational functions: a semidefinite programming approach
- 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 527343 (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
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Numerical solution of saddle point problems
- Optimal primal-dual methods for a class of saddle point problems
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomials on Compact Semialgebraic Sets
- 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
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Semidefinite programming relaxations for semialgebraic problems
- Subgradient methods for saddle-point problems
- The saddle point problem of polynomials
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(6)- Finite algorithm to find the saddle point of a quadratic function subject to linear constraints
- Local saddle points for unconstrained polynomial optimization
- Saddle points and overdetermined complex equations
- Stabilization in computing saddle points
- All saddle points for polynomial optimization
- Quasi-Newton methods for saddlepoints
This page was built for publication: Saddle points of rational functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307710)
