An Algorithmic Framework for MINLP with Separable Non-convexity

Abstract

Global optimization algorithms, e.g., spatial branch-and-bound approaches like those implemented in codes such as BARON and COUENNE, have had substantial success in tackling complicated, but generally small scale, non-convex MINLPs (i.e., mixed-integer nonlinear programs having non-convex continuous relaxations). Because they are aimed at a rather general… (More)

Topics

11 Figures and Tables

Slides referencing similar topics