Optimality conditions for constrained minimax optimization
From MaRDI portal
Cites work
- A necessary and a sufficient optimality condition for bilevel programming problems
- A note on optimality conditions for bilevel programming problems∗
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Foundations of bilevel programming
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Necessary optimality conditions in pessimistic bilevel programming
- New necessary optimality conditions in optimistic bilevel programming
- Numerical Optimization
- On bilevel programming. I: General nonlinear cases
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
Cited in
(11)- Convergence properties of gradient-based methods for minimax problems with nonlinear constraints
- A first-order method for nonconvex-strongly-concave constrained minimax optimization
- Second-order optimality conditions for bi-local solutions of bilevel programs
- Stability for constrained minimax optimization
- Calm local optimality for nonconvex-nonconcave minimax problems
- Directional subdifferential of the value function
- Recent advances in minimax problem and bimatrix games
- An alternating gradient projection algorithm with momentum for nonconvex-concave minimax problems
- Nonsmooth convex-concave saddle point problems with cardinality penalties
- Second-order optimality conditions for nonsmooth constrained optimization with applications to bilevel programming
- Tangential subdifferential-based necessary conditions for multiobjective min-max optimization
This page was built for publication: Optimality conditions for constrained minimax optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941352)
