A duality approach to minimax results for quasi-saddle functions in finite dimensions
From MaRDI portal
Publication:1194857
DOI10.1007/BF01581192zbMath0766.90062OpenAlexW2006533391MaRDI QIDQ1194857
Publication date: 6 October 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581192
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15)
Related Items (8)
Projectively-convex sets and functions ⋮ -convexity ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ A topological minimax theorem ⋮ Topological versions of passy– prisman’S minimax theorem ⋮ Toward A geometric theory of minimax equalities ⋮ Ky-Fan inequality, Nash equilibria in some idempotent and harmonic convex structure ⋮ Some of Sion's heirs and relatives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On general minimax theorems
- Conjugaison par tranches
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Conjugacy in quasi-convex programming
- Exact quasiconvex conjugation
- A Minimax Theorem
- A convex-like duality scheme for quasi-convex programs
- Global saddle-point duality for quasi-concave programs
- Optimization by level set methods. IV: Generalizations and complements
- On $\Phi $-Convexity in Extremal Problems
- Duality theorems for certain programs involving minimum or maximum operations
- Convex Analysis
- Quasi-Convex Programming
- Surrogate Mathematical Programming
- The Generalized Penalty-Function/Surrogate Model
This page was built for publication: A duality approach to minimax results for quasi-saddle functions in finite dimensions