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

DOI10.1007/s10107-005-0591-6zbMath1085.90059OpenAlexW2149771466MaRDI QIDQ2583147

J. B. G. Frenk, Gábor Kassay

Publication date: 13 January 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://repub.eur.nl/pub/1537/ERS%202004%20045%20LIS.pdf

zbMATH Keywords

level set method of Joóminimax theorem of Sion

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Related Items

On equivalent results in minimax theory ⋮ General two-function topological minimax theorems ⋮ On linear programming duality and necessary and sufficient conditions in minimax theory ⋮ Large deviations for Markovian nonlinear Hawkes processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some convexities
• On general minimax theorems
• Note on my paper A simple proof for von Neumann's minimax theorem
• On linear programming duality and necessary and sufficient conditions in minimax theory
• Generalized arcwise-connected functions and characterizations of local- global minimum properties
• Connected level sets, minimizing sets and uniqueness in optimization
• Generalized Concavity
• Theory of Duality in Mathematical Programming