The level set method of Joó and its use in minimax theory
From MaRDI portal
Publication:2583147
DOI10.1007/S10107-005-0591-6zbMATH Open1085.90059OpenAlexW2149771466MaRDI QIDQ2583147FDOQ2583147
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized arcwise-connected functions and characterizations of local- global minimum properties
- On general minimax theorems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some convexities
- Note on my paper A simple proof for von Neumann's minimax theorem
- Theory of Duality in Mathematical Programming
- Generalized Concavity
- Connected level sets, minimizing sets and uniqueness in optimization
- On linear programming duality and necessary and sufficient conditions in minimax theory
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- On linear programming duality and necessary and sufficient conditions in minimax theory
- Large deviations for Markovian nonlinear Hawkes processes
- On the level set method in minimax theory
- On equivalent results in minimax theory
- General two-function topological minimax theorems
This page was built for publication: The level set method of Joó and its use in minimax theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583147)