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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 59; no. 2-3; pp. 673 - 693
Main Authors:	Zorn, Keith, Sahinidis, Nikolaos V.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.07.2014 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!