
Journal of Convex Analysis 13 (2006), No. 1, 101111 Copyright Heldermann Verlag 2006 Minmax Convex Pairs Gabriele H. Greco Dip. di Matematica, Università di Trento, 38050 Povo, Italy greco@science.unitn.it [Abstractpdf] This paper gives some general criteria for recognizing minmax convex pairs, i.e. \textit{pairs} $(X,Y)$ of \textit{convex} subsets of a Hilbert space for which the bilinear \textit{minmax} equality $\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 \textit{normality}, \textit{consistency}, \textit{closure feasibility} and \textit{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, SpringerVerlag, 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. Keywords: Minmax convex pairs, Hilbert space, bilinear minmax equality, normality, consistency, closure feasibility, bounded closed convex sets. [ Fulltextpdf (352 KB)] for subscribers only. 