A hybrid LP/NLP paradigm for global optimization relaxations

Polyhedral relaxations have been incorporated in a variety of solvers for the global optimization of mixed-integer nonlinear programs. Currently, these relaxations constitute the dominant approach in global optimization practice. In this paper, we introduce a new relaxation paradigm for global optim...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 10; no. 3; pp. 383 - 421
Main Authors:	Khajavirad, Aida, Sahinidis, Nikolaos V.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2018 Springer Nature B.V
Subjects:	Convexity Full Length Paper Global optimization Mathematics Mathematics and Statistics Mathematics of Computing Nonlinear programming Operations Research/Decision Theory Optimization Search algorithms Solvers Test procedures Theory of Computation Polyhedral relaxations Nonlinear relaxations Global optimization Automatic convexity detection 90C57 90C25 90C11 90C26 Branch-and-reduce
ISSN:	1867-2949, 1867-2957
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!