Abstract

This paper gives some general criteria for recognizing minmax convex pairs, i.e. pairs (X,Y)(X,Y) of convex subsets of a Hilbert space for which the bilinear minmax equality infsupx∈Xsup⁡y∈Y⟨x,y⟩=sup⁡y∈Yinfsupx∈X⟨x,y⟩\mathop{\rm inf\vphantom{sup}} _{x\in X}\sup_{y\in Y}\langle x,y\rangle =\sup_{y\in Y}\mathop{\rm inf\vphantom{sup}}_{x\in X}\langle x,y\rangle holds. Based on new notions of normality, consistency, closure feasibility and boundary negligibility of pairs of convex sets, such criteria yield new minmax equalities besides the old ones. Included are the celebrated Classical Minmax Theorem (von Neumann 1928, Kneser 1952) for bounded, closed convex sets, Fenchel's Minmax Theorem for polyhedral convex sets (Fenchel 1951), the Fenchel Minmax Theorem for strongly feasible pairs of convex sets [J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization - Theory and Examples, Springer-Verlag, New York 2000] and new minmax theorems (for locally compact sets, for polar sets, …\dots). In the last section minmax convex pairs are used to characterize bounded, closed convex sets. Further investigation on minmax convex pairs relatively to closed hyperplanes and on attainment of extrema in their associated bilinear minmax equalities are left to subsequent papers.

Author information

Contact details are reproduced from the original publication and may be historical.

Keywords

  • Minmax convex pairs
  • Hilbert space
  • bilinear minmax equality
  • normality
  • consistency
  • closure feasibility
  • bounded closed convex sets

References

  1. J. M. Borwein, A. S. Lewis: Convex Analysis and Nonlinear Optimization, Theory and Examples, Springer, New York (2000).https://doi.org/10.1007/978-1-4757-9859-3Google Scholar
  2. W. Fenchel: Convex Cones, Sets and Functions, Mimeographed Lecture Notes, Princeton Univ. Press (1951).Google Scholar
  3. G. H. Greco, A. Flores-Franulič, H. Román-Flores: Fenchel equalities and bilinear minmax equalities, Math. Scand., to appear.Google Scholar
  4. G. H. Greco: Stable minmax convex pairs, forthcoming.Google Scholar
  5. R. B. Holmes: Geometric Functional Analysis and its Applications, Springer, New York (1975).https://doi.org/10.1007/978-1-4684-9369-6Google Scholar
  6. L. Hörmander: Sur la fonction d’appui, Arkiv för Matematik 3 (1954) 181–186.https://doi.org/10.1007/BF02589354Google Scholar
  7. H. Kneser: Sur un théorème fondamental de la theorie des jeux, C. R. Acad. Sci., Paris 234 (1952) 2418–2420.Google Scholar
  8. J. von Neumann: Zur Theorie der Gesellschaftsspiele, Math. Ann. 100 (1928) 295–320.https://doi.org/10.1007/BF01448847Google Scholar
  9. G. Peano: Calcolo geometrico secondo l’Ausdehnungslehre di H. Grassmann, preceduto dalle operazioni della logica deduttiva, Fratelli Bocca Editori, Torino (1888).Google Scholar
  10. R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton, New Jersey (1970).Google Scholar

Suggested citation

G. H. Greco. “Minmax Convex Pairs.” Journal of Convex Analysis 13 (2006), No. 1, 101–111. https://doi.org/10.68381/jca13007

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2006. Rights now held by Banach Press LLC.