A note on nonconvex minimax theorem with separable homogeneous polynomials

DOI10.1007/S10957-011-9827-1MaRDI QIDQ637566zbMATH OpenOpenAlexWikidataFDO

Authors G. Li

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

zbMATH Keywords

generalized convexityminimax theoremlong range convexityseparable homogeneous polynomial

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Convexity of real functions of several variables, generalizations (26B25) Optimality conditions for minimax problems (49K35) Existence of solutions for minimax problems (49J35) Polynomials, rational functions in real analysis (26C99)

Recommendations

• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Publication:4886036
• Existence of Minimizers for Polyconvex and Nonpolyconvex Problems
• Minimizing polynomials on noncompact sets
• A nonconvex separation property and some applications
• Non-uniqueness of minimizers for strictly polyconvex functionals
• scientific article; zbMATH DE number 11722
• scientific article; zbMATH DE number 3873086
• A separation theorem for nonconvex sets and its applications
• On the degree and separability of nonconvexity and applications to optimization problems

Cites work

• scientific article; zbMATH DE number 5662944 (Why is no real title available?)
• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Alternative theorems for quadratic inequality systems and global quadratic optimization
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
• Lagrangian duality and cone convexlike functions
• Necessary and sufficient conditions for S-lemma and~nonconvex quadratic optimization
• New Kuhn-Tucker sufficiency for global optimality via convexification
• Separation of sets and Wolfe duality
• Some applications of the image space analysis to the duality theory for constrained extremum problems
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs

Cited in

(4)

• Minimax theorems for scalar set-valued mappings with nonconvex domains and applications
• Minimax theorem for functions on the Cartesian product of branching polylines
• Theorems of the alternative revisited and some extensions of Yuan's lemma
• A minimax theorem for Lindelöf sets

This page was built for publication: A note on nonconvex minimax theorem with separable homogeneous polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637566)