Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem

DOI10.1016/0167-6377(86)90111-2zbMath0667.49007OpenAlexW2088476850MaRDI QIDQ1117445

Bruce D.Craven, Vaithilingam Jeyakumar

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90111-2

zbMATH Keywords

equivalencefixed point theoremseparation theoremalternative theoremsconvexlike functionsKy Fan type minimax theorems

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Convexity of real functions of several variables, generalizations (26B25)

Related Items

On equivalent results in minimax theory, Optimality and duality in nonsmooth composite vector optimization and applications, A note on nonconvex minimax theorem with separable homogeneous polynomials, A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions], Non-convex infinite games, A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty, On alternative theorems and necessary conditions for efficiency, Theorems of the alternative and optimality conditions for convexlike and general convexlike programming, Convexlike and concavelike conditions in alternative, minimax, and minimization theorems

Cites Work

• A generalization of a minimax theorem of Fan via a theorem of the alternative
• The fixed point theory of multi-valued mappings in topological vector spaces
• Systems of Inequalities Involving Convex Functions
• Characterizations of optimality without constraint qualification for the abstract convex program
• Minimax Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item