Skip to main content
Log in

The level set method of Joó and its use in minimax theory

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we discuss the level set method of Joó and how to use it to give an elementary proof of the well-known minimax theorem of Sion. Although this proof technique was initiated by Joó and based on the intersection of upper level sets and a clever use of the topological notion of connectedness, it is not very well known and accessible for researchers in optimization. At the same time we simplify the original proof of Joó and give a more elementary proof of the celebrated minimax theorem of Sion.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aubin, J.B.: Optima and Equilibra: An Introduction to Nonlinear Analysis. Graduate Texts in Mathematics 140 Springer Verlag, Berlin, 1993

  2. Avriel, M., Zang, I.: Generalized arcwise-connected functions and characterizations of local-global minimum properties. Journal of Optimization Theory and Applications 32 (4), 407–425 (1980)

    MathSciNet  Google Scholar 

  3. Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity: Mathematical Concepts and Methods in Engineering 36, Plenum Press, New York, 1970

  4. Choquet, G.: Lectures on Analysis Volume 1: Integration and Topological Vector Spaces. Mathematics Lecture Note Series W.A.Benjamin, Reading, Massachusetts, 1976

  5. Engelking, R.: Outline of General Topology. North-Holland, Amsterdam, 1968

  6. Faigle, U., Kern, W., Still, G.: Algorithmic Principles of Mathematical Programming. Kluwer texts in Mathematical Sciences 24, Kluwer Academic Publishers, Dordrecht, 2002

  7. Frenk, J.B.G., Kas, P. Kassay, G.: On linear programming duality and necessary and sufficient conditions in minimax theory. Accepted by Journal of Optimization Theory and Applications, 2004

  8. Joó, I.: Note on my paper: A simple proof of von Neumann's minimax theorem. Acta Math.Hung. 44 (3–4), 363–365 (1984)

    Google Scholar 

  9. Joó, I.: On some convexities. Acta Math. Hung. 54 (1-2), 163–172 (1989)

  10. Martin, D.H.: Connected level sets minimizing sets and uniqueness in optimization. Journal of Optimization Theory and Applications 36 (1), 71–91 (1982)

    MathSciNet  Google Scholar 

  11. Ortega, J.M., Rheinboldt, W.C.: Iterative Solutions of Nonlinear Equations in Several Variables. Computer Science and Applied Mathematics Academic Press, New York, 1970

  12. Rudin W.: Principles of Mathematical Analysis. McGraw-Hill, New York, 1976

  13. Sion, M.: On general minimax theorems. Pacific J. Math 8, 171–176 (1958)

    MATH  MathSciNet  Google Scholar 

  14. Vorob'ev N.N.: Game Theory: Lectures for Economists and Systems Scientists. Springer Verlag, New York, (1977)

  15. Walk, M.: Theory of Duality in Mathematical Programming. Springer-Verlag, Wien, (1989)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J.B.G. Frenk.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frenk, J., Kassay, G. The level set method of Joó and its use in minimax theory. Math. Program. 105, 145–155 (2006). https://doi.org/10.1007/s10107-005-0591-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0591-6

Keywords

Navigation