On penalty methods for minimax problems
From MaRDI portal
Recommendations
Cites work
- A Convergence Theory for Saddle Functions
- A general correspondence between dual minimax problems and convex programs
- An exponential penalty method for nondifferentiable minimax problems with general constraints
- Dual Operations on Saddle Functions
- Envelope Correspondence and Its Application to the Design of Guaranteed Error Controllers
- scientific article; zbMATH DE number 3816457 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3441151 (Why is no real title available?)
- Problèmes de minimax via l'analyse convexe et les inégalités variationelles: Théorie et algorithmes
Cited in
(4)- Solving minimum norm problems using penalty functions and the gradient method
- Approximating saddle points as equilibria of differential inclusions
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- A note on solving nonlinear minimax problems via a differentiable penalty function
This page was built for publication: On penalty methods for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795491)