Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations

DOI10.1007/s10898-013-0058-xzbMath1319.90052OpenAlexW2105061215WikidataQ59241484 ScholiaQ59241484MaRDI QIDQ2442635

Guoyin Li, S. Srisatkunarajah, Vaithilingam Jeyakumar

Publication date: 1 April 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0058-x

zbMATH Keywords

global optimizationbox constraintspolynomial optimizationglobal optimality conditionsbivalent constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (4)

Global optimality conditions for cubic minimization problems with cubic constraints ⋮ 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 ⋮ Semidefinite program duals for separable polynomial programs involving box constraints

Uses Software

• YALMIP

Cites Work

• Unnamed Item
• Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
• Global optimality conditions for some classes of polynomial integer programming problems
• Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Handbook on semidefinite, conic and polynomial optimization
• Sufficient global optimality conditions for bivalent quadratic optimization
• A convex polynomial that is not sos-convex
• Semidefinite representation of convex sets
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• A quadratic assignment formulation of the molecular conformation problem
• Handbook of global optimization
• Semidefinite programming relaxations for semialgebraic problems
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Global optimality conditions for cubic minimization problem with box or binary constraints
• Second-order sufficient optimality conditions for local and global nonlinear programming
• Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Polynomials nonnegative on a grid and discrete optimization
• Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
• Semidefinite Optimization and Convex Algebraic Geometry
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• Optimal Inequalities in Probability Theory: A Convex Optimization Approach

This page was built for publication: Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations