Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2012 | public
Journal Article

Convergence rate of McCormick relaxations

Abstract

Theory for the convergence order of the convex relaxations by McCormick (Math Program 10(1):147–175, 1976) for factorable functions is developed. Convergence rules are established for the addition, multiplication and composition operations. The convergence order is considered both in terms of pointwise convergence and of convergence in the Hausdorff metric. The convergence order of the composite function depends on the convergence order of the relaxations of the factors. No improvement in the order of convergence compared to that of the underlying bound calculation, e.g., via interval extensions, can be guaranteed unless the relaxations of the factors have pointwise convergence of high order. The McCormick relaxations are compared with the αBB relaxations by Floudas and coworkers (J Chem Phys, 1992, J Glob Optim, 1995, 1996), which guarantee quadratic convergence. Illustrative and numerical examples are given.

Additional Information

© 2011 Springer Science+Business Media, LLC. Received: 8 July 2010. Accepted: 1 February 2011. Published online: 18 February 2011. We would like to thank Corey J. Noone for useful suggestions. We are grateful to Benoît Chachuat for providing libMC/MC++. We appreciate the thorough comments provided by the anonymous reviewers and editors which resulted in a significantly improved manuscript.

Additional details

Created:
August 22, 2023
Modified:
October 24, 2023