Global optimization of bounded factorable functions with discontinuities

A deterministic global optimization method is developed for a class of discontinuous functions. McCormick's method to obtain relaxations of nonconvex functions is extended to discontinuous factorable functions by representing a discontinuity with a step function. The properties of the relaxatio...

Full description

Bibliographic Details
Main Authors: Wechsung, Achim (Contributor), Barton, Paul I. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Chemical Engineering (Contributor), Massachusetts Institute of Technology. Process Systems Engineering Laboratory (Contributor)
Format: Article
Language:English
Published: Springer US, 2016-07-14T19:57:36Z.
Subjects:
Online Access:Get fulltext
LEADER 01900 am a22002173u 4500
001 103613
042 |a dc 
100 1 0 |a Wechsung, Achim  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Chemical Engineering  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Process Systems Engineering Laboratory  |e contributor 
100 1 0 |a Barton, Paul I.  |e contributor 
100 1 0 |a Wechsung, Achim  |e contributor 
700 1 0 |a Barton, Paul I.  |e author 
245 0 0 |a Global optimization of bounded factorable functions with discontinuities 
260 |b Springer US,   |c 2016-07-14T19:57:36Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/103613 
520 |a A deterministic global optimization method is developed for a class of discontinuous functions. McCormick's method to obtain relaxations of nonconvex functions is extended to discontinuous factorable functions by representing a discontinuity with a step function. The properties of the relaxations are analyzed in detail; in particular, convergence of the relaxations to the function is established given some assumptions on the bounds derived from interval arithmetic. The obtained convex relaxations are used in a branch-and-bound scheme to formulate lower bounding problems. Furthermore, convergence of the branch-and-bound algorithm for discontinuous functions is analyzed and assumptions are derived to guarantee convergence. A key advantage of the proposed method over reformulating the discontinuous problem as a MINLP or MPEC is avoiding the increase in problem size that slows global optimization. Several numerical examples for the global optimization of functions with discontinuities are presented, including ones taken from process design and equipment sizing as well as discrete-time hybrid systems. 
520 |a Statoil ASA 
546 |a en 
655 7 |a Article 
773 |t Journal of Global Optimization