http://hdl.handle.net/1765/19273
http://dx.doi.org/10.1007/s10107-005-0591-6
series: EI-1395
EI-1395
http://dx.doi.org/10.1007/s10107-005-0591-6
series: EI-1395
EI-1395
The level set method of Joó and its use in minimax theory
January 2006
Article
volume 105, issue 1 pp 145-155.
This publication is part of collection
| Related Files |
|---|
|
Redirect to publisher's version
(publisher's version.url.txt, 43 bytes) |
Repository contains one additional file which is not publicly available
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.
Keywords