Box-constrained mixed-integer polynomial optimization using separable underestimators

DOI10.1007/978-3-319-07557-0_17MaRDI QIDQ5418996zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, Claudia D'Ambrosio

Publication date 2 June 2014

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07557-0_17

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Convex underestimators of polynomials
• Integer Polynomial Optimization in Fixed Dimension
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set

Cited in

(4)

• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
• Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
• Norm bounds and underestimators for unconstrained polynomial integer minimization

This page was built for publication: Box-constrained mixed-integer polynomial optimization using separable underestimators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418996)