A note on nonconvex minimax theorem with separable homogeneous polynomials
From MaRDI portal
Publication:637566
DOI10.1007/s10957-011-9827-1zbMath1229.49008OpenAlexW2073890291WikidataQ59241534 ScholiaQ59241534MaRDI QIDQ637566
Publication date: 6 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9827-1
Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35) Optimality conditions for minimax problems (49K35) Convexity of real functions of several variables, generalizations (26B25) Polynomials, rational functions in real analysis (26C99)
Related Items (3)
Theorems of the alternative revisited and some extensions of Yuan's lemma ⋮ Minimax theorems for scalar set-valued mappings with nonconvex domains and applications ⋮ A minimax theorem for Lindelöf sets
Cites Work
- Unnamed Item
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Separation of sets and Wolfe duality
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- New Kuhn-Tucker sufficiency for global optimality via convexification
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
- Lagrangian duality and cone convexlike functions
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
This page was built for publication: A note on nonconvex minimax theorem with separable homogeneous polynomials
