Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
Name
10898_2018_691_ReferencePDF.pdf
Size
1.35 MB
Format
Adobe PDF
Checksum (MD5)
cb1b06644305bb9cdf5a3c1bd2eac33c
Author(s)
Schaber, Spencer D
Scott, Joseph K
Barton, Paul I
Date Issued
August 1, 2018
Publisher
Springer US
Version
Author's final manuscript
Abstract
Abstract
For the performance of global optimization algorithms, the rate of convergence of convex relaxations to the objective and constraint functions is critical. We extend results from Bompadre and Mitsos (J Glob Optim 52(1):1–28, 2012) to characterize the convergence rate of parametric bounds and relaxations of the solutions of ordinary differential equations (ODEs). Such bounds and relaxations are used for global dynamic optimization and are computed using auxiliary ODE systems that use interval arithmetic and McCormick relaxations. Two ODE relaxation methods (Scott et al. in Optim Control Appl Methods 34(2):145–163, 2013; Scott and Barton in J Glob Optim 57:143–176, 2013) are shown to give second-order convergence, yet they can behave very differently from each other in practice. As time progresses, the prefactor in the convergence-order bound tends to grow much more slowly for one of these methods, and can even decrease over time, yielding global optimization procedures that require significantly less computation time.
MIT Department
Massachusetts Institute of Technology. Department of Chemical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10898-018-0691-5
