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

We introduce a new method for solving box-constrained mixed-integer polynomial problems to global optimality. The approach, a specialized branch-and-bound algorithm, is based on the computation of lower bounds provided by the minimization of separable underestimators of the polynomial objective func...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 67; no. 4; pp. 759 - 786
Main Authors:	Buchheim, Christoph, D’Ambrosio, Claudia
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2017 Springer Springer Nature B.V
Subjects:	Algorithms Branch & bound algorithms Computation Computer Science Linear programming Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Nonlinear programming Operations Research/Decision Theory Optimization Polynomials Real Functions Solvers Studies Polynomial optimization Mixed-integer nonlinear programming Separable underestimators
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!