Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
From MaRDI portal
Publication:623367
DOI10.1007/s10107-009-0283-8zbMath1206.90126OpenAlexW2066821525WikidataQ59241540 ScholiaQ59241540MaRDI QIDQ623367
Vaithilingam Jeyakumar, Guoyin Li
Publication date: 14 February 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0283-8
sums of squares polynomialsnecessary global optimality conditionspolynomial constraintspolynomial over-estimatorssemi-algebraic geometry
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory ⋮ Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition ⋮ Global error bounds for piecewise convex polynomials ⋮ Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables ⋮ Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Global optimality conditions and optimization methods for polynomial programming problems ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ A new class of alternative theorems for SOS-convex inequalities and robust optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Conditions for global optimality. II
- Handbook of global optimization. Vol. 2
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Nonsmooth vector functions and continuous optimization
- Minimizing polynomials via sum of squares over the gradient ideal
- Fractional programming with convex quadratic forms and functions
- Global Optimization with Polynomials and the Problem of Moments
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Transposition Theorems and Qualification‐Free Optimality Conditions
