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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 59; H. 2-3; S. 673 - 693
Hauptverfasser:	Zorn, Keith, Sahinidis, Nikolaos V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.07.2014 Springer Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!