The level set method of Joo and its use in minimax theory

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Springer

Access Rights

info:eu-repo/semantics/closedAccess

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.

Description

Keywords

Journal or Series

Mathematical Programming

WoS Q Value

Scopus Q Value

Volume

105

Issue

1

Citation

Endorsement

Review

Supplemented By

Referenced By