Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimax theorems in a fully non-convex setting

From MaRDI portal
Publication:5244130
Jump to:navigation, search

DOI10.23952/JNVA.3.2019.1.05zbMath1435.49002arXiv1812.06826OpenAlexW2905432291MaRDI QIDQ5244130

Biagio Ricceri

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


zbMATH Keywords

connectednessminimax theoremreal intervalglobal extremum


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5244130&oldid=19866823"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 19:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki