Imperial College London


Faculty of EngineeringDepartment of Chemical Engineering

Reader in Process Systems Engineering



b.chachuat Website




609Roderic Hill BuildingSouth Kensington Campus






BibTex format

author = {Houska, B and Chachuat, B},
doi = {10.1007/s10957-013-0426-1},
journal = {Journal of Optimization Theory and Applications},
pages = {208--248},
title = {Branch-and-Lift Algorithm for Deterministic Global Optimization in Nonlinear Optimal Control},
url = {},
volume = {162},
year = {2014}

RIS format (EndNote, RefMan)

AB - This paper presents a branch-and-lift algorithm for solving optimal control problems with smooth nonlinear dynamics and potentially nonconvex objective and constraint functionals to guaranteed global optimality. This algorithm features a direct sequential method and builds upon a generic, spatial branch-and-bound algorithm. A new operation, called lifting, is introduced, which refines the control parameterization via a Gram-Schmidt orthogonalization process, while simultaneously eliminating control subregions that are either infeasible or that provably cannot contain any global optima. Conditions are given under which the image of the control parameterization error in the state space contracts exponentially as the parameterization order is increased, thereby making the lifting operation efficient. A computational technique based on ellipsoidal calculus is also developed that satisfies these conditions. The practical applicability of branch-and-lift is illustrated in a numerical example. © 2013 Springer Science+Business Media New York.
AU - Houska,B
AU - Chachuat,B
DO - 10.1007/s10957-013-0426-1
EP - 248
PY - 2014///
SN - 0022-3239
SP - 208
TI - Branch-and-Lift Algorithm for Deterministic Global Optimization in Nonlinear Optimal Control
T2 - Journal of Optimization Theory and Applications
UR -
UR -
VL - 162
ER -