Saddle points of rational functions
From MaRDI portal
Publication:2307710
DOI10.1007/S10589-019-00141-6zbMATH Open1441.90179OpenAlexW2985462819WikidataQ126802388 ScholiaQ126802388MaRDI QIDQ2307710FDOQ2307710
Qin Wang, Guangming Zhou, Wenjie Zhao
Publication date: 25 March 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00141-6
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Subgradient methods for saddle-point problems
- Global optimization with polynomials and the problem of moments
- 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
- Numerical solution of saddle point problems
- Semidefinite programming relaxations for semialgebraic problems
- Global minimization of rational functions and the nearest GCDs
- Global optimization of rational functions: a semidefinite programming approach
- GloptiPoly 3: moments, optimization and semidefinite programming
- Optimization of Polynomials on Compact Semialgebraic Sets
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Algebraic Degree of Polynomial Optimization
- Linear optimization with cones of moments and nonnegative polynomials
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Polynomial optimization with real varieties
- The saddle point problem of polynomials
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
Cited In (2)
Uses Software
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)
