Minimax theorems in a fully non-convex setting

2018/12/17 by Biagio Ricceri, Ricceri, Biagio · 2 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Functional Analysis (math.FA) #Mathematical Inequalities and Applications #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1812.06826

openalex publication_date 2018/12/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we establish two minimax theorems for functions f:X× I→ \bf R, where I is a real interval, without assuming that f(x,⋅) is quasi-concave. Also, some related applications are presented.

Cited by

• Proximal and Contraction method with Relaxed Inertial and Correction Terms for Solving Mixed Variational Inequality Problems
• Forward-Backward-Forward Dynamical System for Solving Mixed Variational Inequality Problems

Related

• On a minimax theorem: an improvement, a new proof and an overview of its applications
• Minimax theorems for convex functions
• A non-convex relaxed version of minimax theorems
• Applying twice a minimax theorem
• A more complete version of a minimax theorem