The Level Set Method Of Joó And Its Use In Minimax Theory
2004-08-30
Research Paper
This publication is part of collections
| Related Files |
|---|
View PDF Version
(ERS 2004 045 LIS.pdf, 0.2MB) |
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 Sion’s minimax result. Although this proof technique is initiated by Joó and based on the inter-section 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 simplified the original proof of Joó and give a more elementary proof of the celebrated Sion’s minimax theorem.
Keywords
Classifications using
Journal of Economic Literature (JEL) Classification System
- C61 : Optimization Techniques; Programming Models; Dynamic Analysis
- M : Business Administration and Business Economics; Marketing; Accounting
- R4 : Transportation Systems
- M11 : Production Management
Automatically Extracted Terms
- function
- proof
- result
- theorem
- minimax
- level
- topological
- minimax theorem
- lemma
- topological space
- theory
- supaa
- relation
- definition
- space
- management
- method
- nonempty
- optimization
- level sets
