Minimax monotonicity (Q1264182)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1194945
Language Label Description Also known as
default for all languages
No label defined
    English
    Minimax monotonicity
    scientific article; zbMATH DE number 1194945

      Statements

      Minimax monotonicity (English)
      0 references
      31 August 1998
      0 references
      Applications of the von Neumann minimax theorem to functional analysis, in particular, monotone operators are considered. The theorem proves equality of minimax and maximin for convex-concave functionals. This theorem combined with the Hahn-Banach theorem (that a sublinear functional may be majorized by a linear one), and the Banach-Alaoglu theorem (about weak compactness of a ball in dual space) provides the author with the minimax technique to obtain new results and to get simple proofs for well-known theorems. For example, Rockafellar's characterization of those monotone operators on a reflexive space that are maximal, the local boundedness of any nontrivial monotone multifunction in any absorbing point of its domain, the convexity of the domain of a maximal monotone multifunction, and so on. Some of the known results are strengthened or generalized. The author proves that any point surrounded by the domain of a maximal monotone multifunction is an interior point of that domain. Using the minimax technique, the open mapping theorem is generalized. This helps to give a necessary and sufficient condition for the sum of maximal monotone multifunctions on a reflexive Banach space to be maximal monotone. Some nonreflexive cases are also considered. Note the generalizations of Rockafellar's result on maximal monotonicity of subdifferentials. For unbounded (discontinuous) positive linear operators from a Banach space to its dual, a criterion is given to be maximal monotone and other related properties are discussed. The most results obtained are based on the notion of ``big convexification'' of a multifunction graph, the set of probability measures with finite support contained in the graph. Three functionals on the set are introduced such that the relationships between their values give the monotonicity and maximal monotonicity conditions in the book.
      0 references
      von Neumann minimax theorem
      0 references
      monotone operators
      0 references
      Hahn-Banach theorem
      0 references
      sublinear functional
      0 references
      Banach-Alaoglu theorem
      0 references
      weak compactness
      0 references
      duality
      0 references
      subdifferentials
      0 references
      constraint qualification
      0 references
      open mapping theorem
      0 references
      maximal monotone multifunctions
      0 references
      big convexification
      0 references
      multifunction graph
      0 references
      probability measures with finite support contained in the graph
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references