Subdifferentiability and inf-sup theorems
From MaRDI portal
The authors present an abstract set of hypotheses yielding the equality \[ \underset{y\in Y}{\text{Sup}} \underset{x\in X} {\text{Inf}} L(x,y)= \underset{x\in X} {\text{Inf}} \underset{y\in Y} {\text{Sup}} L(x,y), \] where \(L\) is an extended-real-valued function defined on the Cartesian product \(X\times Y\). The main feature of their minimax result is the lack of compactness assumptions, something which is compensated here with a suitable ``qualification condition of the Attouch-Brezis type.
Recommendations
Cited in
(9)- Duality in D. C. programming: The case of several D. C. constraints
- Differentiability and subdifferentiability on semilinear spaces
- Subdifferentiability and the duality gap
- New tour on the subdifferential of supremum via finite sums and suprema
- Subdifferentiability of typical continuous functions
- scientific article; zbMATH DE number 1330551 (Why is no real title available?)
- Theorems of the Alternative and Duality for INF-SUP Problems
- Compact subdifferentials: the formula of finite increments and related topics
- Supremum norm differentiability
This page was built for publication: Subdifferentiability and inf-sup theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961279)