The computation of lower bounds via the solution of convex lower bounding problems depicts current state-of-the-art in deterministic global optimization. Typically, the nonlinear convex relaxations are further underestimated through linearizations of the convex underestimators at one or several...

This article presents an analysis of the convergence order of Taylor models and McCormick-Taylor models, namely Taylor models with McCormick relaxations as the remainder bounder, for factorable functions. Building upon the analysis of McCormick relaxations by Bompadre and Mitsos (J Glob Optim...

The algorithm proposed in Mitsos (Optimization 60(10–11):1291–1308, <CitationRef CitationID="CR17">2011</CitationRef>) for the global optimization of semi-infinite programs is extended to the global optimization of generalized semi-infinite programs. No convexity or concavity assumptions are made. The algorithm employs convergent lower...</citationref>