Minimax theorems for Ф-convex functions: sufficient and necessary conditions
Monika Syga · Optimization · 2015
We prove minimax theorems for -convex functions. The novelty of the theorems relies on the use of the weak -intersection property which allows to relax the compactness assumption of the underlying spaces. The weak -intersection property appears to be sufficient and necessary conditions for the minimax equality to hold.