Skip to main content
Log in

On Fan's minimax theorem

  • Published:
Mathematical Programming Submit manuscript

Abstract

A new brief proof of Fan's minimax theorem for convex-concave like functions is established using separation arguments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C.E. Blair, R.J. Duffin and R.G. Jeroslow, “A limiting infisup theorem“,Journal of Optimization Theory and Applications 37 (1982) 163–175.

    Google Scholar 

  2. K. Fan, “Minimax theorems“,National Academy of Sciences, Washington, DC, Proceedings USA 39 (1953) 42–47.

    Google Scholar 

  3. R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1969).

    Google Scholar 

  4. J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions: I (Springer-Verlag, New York, 1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borwein, J.M., Zhuang, D. On Fan's minimax theorem. Mathematical Programming 34, 232–234 (1986). https://doi.org/10.1007/BF01580587

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580587

Key words

Navigation