Global optimization of general nonconvex problems with intermediate polynomial substructures

This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial substructures. We incorporate linear cutting planes inspired by reformulation-linearization techniques to produce tight subproblem formulations that...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 59; číslo 2-3; s. 673 - 693
Hlavní autori:	Zorn, Keith, Sahinidis, Nikolaos V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.07.2014 Springer Springer Nature B.V
Predmet:	Algorithms Branch & bound algorithms Computer Science Cutting Filtering Linear programming Mathematical analysis Mathematical models Mathematical programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Planes Polynomials Real Functions Studies Substructures Variables Factorable polyhedral relaxation Reformulation-linearization techniques Branch-and-bound global optimization Polynomial programming
ISSN:	0925-5001, 1573-2916
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!