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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming computation Ročník 10; číslo 3; s. 383 - 421
Hlavní autori:	Khajavirad, Aida, Sahinidis, Nikolaos V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2018 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!