A Minimax Theorem
From MaRDI portal
Publication:3689751
DOI10.1287/moor.9.4.576zbMath0572.49003OpenAlexW2048043533MaRDI QIDQ3689751
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
Convex programming (90C25) Existence of solutions for minimax problems (49J35) Programming in abstract spaces (90C48) Methods involving semicontinuity and convergence; relaxation (49J45) Duality theory (optimization) (49N15) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items (6)
Continuity properties of \(\varepsilon\)-solutions for a generalized parametric saddle point problems and application to hierarchical games ⋮ On weak * closedness, coerciveness, and inf-sup theorems ⋮ A duality approach to minimax results for quasi-saddle functions in finite dimensions ⋮ On randomized fictitious play for approximating saddle points over convex sets ⋮ Penalty functions in ε-programming and ε-minimax problems ⋮ Inequality systems and optimization
This page was built for publication: A Minimax Theorem
