Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
From MaRDI portal
Publication:6553367
Recommendations
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- Proximal point algorithms for nonconvex-nonconcave minimax optimization problems
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- A Newton-based method for nonconvex optimization with fast evasion of saddle points
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
Cites work
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- A primer on monotone operator methods
- An overview of bilevel optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Foundations of bilevel programming
- scientific article; zbMATH DE number 1342066 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Linear systems theory
- Modifying the inertia of matrices arising in optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Robust optimization-methodology and applications
- Simultaneous nonlinear model predictive control and state estimation
- Symmetric Quasidefinite Matrices
- The Schur complement and its applications
- Theory and applications of robust optimization
- Tractable stochastic analysis in high dimensions via robust optimization
- Zur Theorie der Gesellschaftsspiele.
Cited in
(3)- The computation of approximate feedback Stackelberg equilibria in multiplayer nonlinear constrained dynamic games
- Convergence properties of gradient-based methods for minimax problems with nonlinear constraints
- An improved search direction based on algebraic equivalent transformation technique for convex quadratic optimization
This page was built for publication: Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6553367)