A note on nonconvex minimax theorem with separable homogeneous polynomials
The paper states and proves a minimax theorem for nonconvex bifunctions of a special type. The main result runs as follows. For each \(q\in \mathbb{N}\), let \(S_{q}\) be the set of polynomials of the form \(f(x_{1},x_{2},\ldots,x_{m})=\sum_{j=1}^{m}\alpha_{j}x_{j}^{q}+b\) where \(b\in \mathbb{R}\) and \(\alpha_{j}\in \mathbb{R}\), \(j=1,2\ldots,m\). Let \(\Delta\) be a compact box in \(\mathbb{R}^{m}\) and \(A\) a convex subset in \(\mathbb{R}^{n}\). If \(f:\mathbb{R}^{m}\times \mathbb{R}^{n}\rightarrow \mathbb{R}\cup \{+\infty \}\) is a bifunction such that \(f(x,\cdot)\) is convex for all \(x\in \Delta\) and \(f(\cdot,y)\in S_{q}\) for all \(y\in A\), then \[ \inf_{y\in A}\max_{x\in \Delta}f(x,y)=\max_{x\in \Delta}\inf_{y\in A}f(x,y). \] Some results follow as corollaries; among them, von Neumann's minimax theorem.
- 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
- 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
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- 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
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)
