Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization

DOI10.1007/s10898-016-0443-3zbMath1370.90153OpenAlexW2405834241MaRDI QIDQ522270

Claudia D'Ambrosio, Christoph Buchheim

Publication date: 28 April 2017

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

Full work available at URL: https://doi.org/10.1007/s10898-016-0443-3

zbMATH Keywords

polynomial optimizationmixed-integer nonlinear programmingseparable underestimators

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (5)

Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ Efficient linear reformulations for binary polynomial optimization problems ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Uses Software

• GloptiPoly
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Extending the QCR method to general mixed-integer programs
• SCIP: solving constraint integer programs
• Mixed integer nonlinear programming tools: a practical overview
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A polyhedral branch-and-cut approach to global optimization
• Convex underestimators of polynomials
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Mixed integer nonlinear programming tools: an updated practical overview
• An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
• Branching and bounds tighteningtechniques for non-convex MINLP
• GloptiPoly 3: moments, optimization and semidefinite programming
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Class of global minimum bounds of polynomial functions
• Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators
• Mixed-integer nonlinear optimization
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

This page was built for publication: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization