Global Optimization with C^2 Constraints by Convex Reformulations

A1 Journal article (refereed)

Internal Authors/Editors

Publication Details

List of Authors: Anders Skjäl, Andreas Lundell, Tapio Westerlund
Publication year: 2011
Journal: Chemical Engineering Transactions
Journal acronym: CHEM ENGINEER TRANS
Volume number: 24
Start page: 373
End page: 378
Number of pages: 6
ISSN: 1974-9791


The well-known alpha BB method solves very general smooth nonconvex optimization problems. The algorithm works by replacing nonconvex functions with convex underestimators. The approximations are improved by branching and bounding until global optimality is achieved. Applications are abundant in engineering and science. We present a convex formulation in which the underestimators are improved without directly splitting the domain in a branch-and-bound tree. We show two illustrative examples and discuss some possible gains and drawbacks with the algorithm.

Last updated on 2020-28-01 at 07:38