Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
DOI10.1007/S10107-009-0283-8zbMATH Open1206.90126DBLPjournals/mp/JeyakumarL11OpenAlexW2066821525WikidataQ59241540 ScholiaQ59241540MaRDI QIDQ623367FDOQ623367
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
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Minimizing polynomials via sum of squares over the gradient ideal
- Title not available (Why is that?)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Nonsmooth vector functions and continuous optimization
- Fractional programming with convex quadratic forms and functions
- Title not available (Why is that?)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Transposition Theorems and Qualification‐Free Optimality Conditions
Cited In (17)
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Optimality Conditions for the Minimization of Quadratic 0-1 Problems
- Global optimality conditions for nonlinear programming problems with linear equality constraints
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- Global error bounds for piecewise convex polynomials
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Global optimality conditions and optimization methods for polynomial programming problems
- Optimality conditions and optimization methods for quartic polynomial optimization
- Title not available (Why is that?)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Global optimality conditions and optimization methods for polynomial programming problems 👍 👎
- Global optimality conditions and optimization methods for constrained polynomial programming problems 👍 👎
- Global optimality conditions for nonlinear programming problems with linear equality constraints 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623367)
