A Minimax Theorem
DOI10.1287/MOOR.9.4.576zbMATH Open0572.49003OpenAlexW2048043533MaRDI QIDQ3689751FDOQ3689751
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.9.4.576
Recommendations
Convex programming (90C25) Methods involving semicontinuity and convergence; relaxation (49J45) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Programming in abstract spaces (90C48) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15)
Cited In (17)
- Minimax theorems and saddling transformations
- A minimax theorem
- A duality approach to minimax results for quasi-saddle functions in finite dimensions
- Fenchel equalities and bilinear minmax equalities
- Minimax theorems
- Inequality systems and optimization
- On randomized fictitious play for approximating saddle points over convex sets
- Title not available (Why is that?)
- On weak * closedness, coerciveness, and inf-sup theorems
- Title not available (Why is that?)
- A general min-max theorem
- Minimax theorems revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimax theorems with applications to convex metric spaces
- Continuity properties of \(\varepsilon\)-solutions for a generalized parametric saddle point problems and application to hierarchical games
- Penalty functions in ε-programming and ε-minimax problems
This page was built for publication: A Minimax Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689751)
