Optimality Conditions for Minimizers at Infinity in Polynomial Programming
DOI10.1287/moor.2018.0974zbMath1437.90160arXiv1706.00234OpenAlexW2964195375WikidataQ114058161 ScholiaQ114058161MaRDI QIDQ5108246
Publication date: 30 April 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.00234
Newton polyhedronKarush-Kuhn-Tucker optimality conditionsexistence of minimizerspolynomial programmingMangasarian-Fromovitz constraint qualificationFrank-Wolfe theoremFritz John optimality conditionsFermat theorem
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Polynomials in number theory (11C08) Semialgebraic sets and related spaces (14P10) Special polynomials in general fields (12E10) Real polynomials: analytic properties, etc. (26C05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- Origin and evolution of the Palais-Smale condition in critical point theory
- Set intersection theorems and existence of optimal solutions
- On \(\ell_ p\) programming
- On the bifurcation set of a polynomial function and Newton boundary
- Polyedres de Newton et nombres de Milnor
- On extensions of the Frank-Wolfe theorems
- A Frank--Wolfe type theorem for convex polynomial programs
- Minimizing polynomials via sum of squares over the gradient ideal
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Global Hölderian Error Bound for Nondegenerate Polynomials
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Genericity in Polynomial Optimization
- A generalization of the Frank—Wolfe theorem
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Coercive Polynomials and Their Newton Polytopes
- Well-Posedness in Unconstrained Polynomial Optimization Problems
This page was built for publication: Optimality Conditions for Minimizers at Infinity in Polynomial Programming
