Minimax theorems in a fully non-convex setting
From MaRDI portal
Publication:5244130
DOI10.23952/JNVA.3.2019.1.05zbMath1435.49002arXiv1812.06826OpenAlexW2905432291MaRDI QIDQ5244130
Publication date: 20 November 2019
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.06826
Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35) Optimality conditions for minimax problems (49K35) Optimality conditions for problems in abstract spaces (49K27)
Related Items (3)
Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Some topological mini-max theorems via an alternative principle for multifunctions
- On general minimax theorems
- Connectedness of sublevels of integral functionals
- On a minimax theorem: an improvement, a new proof and an overview of its applications
- On the Infimum of Certain Functionals
This page was built for publication: Minimax theorems in a fully non-convex setting