The level set method of Joo and its use in minimax theory
| dc.contributor.author | Frenk, JBG | |
| dc.contributor.author | Kassay, G | |
| dc.date.accessioned | 2026-02-06T18:34:15Z | |
| dc.date.issued | 2006 | |
| dc.department | Doğu Akdeniz Üniversitesi | |
| dc.description.abstract | In this paper we discuss the level set method of Joo 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 Joo 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 Joo and give a more elementary proof of the celebrated minimax theorem of Sion. | |
| dc.identifier.doi | 10.1007/s10107-005-0591-6 | |
| dc.identifier.endpage | 155 | |
| dc.identifier.issn | 0025-5610 | |
| dc.identifier.issue | 1 | |
| dc.identifier.orcid | 0000-0002-2161-8681 | |
| dc.identifier.orcid | 0000-0003-1269-6095 | |
| dc.identifier.scopus | 2-s2.0-28244432790 | |
| dc.identifier.scopusquality | Q1 | |
| dc.identifier.startpage | 145 | |
| dc.identifier.uri | https://doi.org/10.1007/s10107-005-0591-6 | |
| dc.identifier.uri | https://hdl.handle.net/11129/11703 | |
| dc.identifier.volume | 105 | |
| dc.identifier.wos | WOS:000233547600007 | |
| dc.identifier.wosquality | Q1 | |
| dc.indekslendigikaynak | Web of Science | |
| dc.indekslendigikaynak | Scopus | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Mathematical Programming | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.snmz | KA_WoS_20260204 | |
| dc.title | The level set method of Joo and its use in minimax theory | |
| dc.type | Article |










