Global dynamic optimization
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Chemical Engineering, 2004.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/28662 |
| _version_ | 1811076979068239872 |
|---|---|
| author | Singer, Adam B |
| author2 | Paul I. Barton. |
| author_facet | Paul I. Barton. Singer, Adam B |
| author_sort | Singer, Adam B |
| collection | MIT |
| description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Chemical Engineering, 2004. |
| first_indexed | 2024-09-23T10:33:26Z |
| format | Thesis |
| id | mit-1721.1/28662 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T10:33:26Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/286622019-04-11T07:06:32Z Global dynamic optimization Singer, Adam B Paul I. Barton. Massachusetts Institute of Technology. Dept. of Chemical Engineering. Massachusetts Institute of Technology. Dept. of Chemical Engineering. Chemical Engineering. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Chemical Engineering, 2004. Includes bibliographical references (p. 247-256). (cont.) on a set composed of the Cartesian product between the parameter bounds and the state bounds. Furthermore, I show that the solution of the differential equations is affine in the parameters. Because the feasible set is convex pointwise in time, the standard result that a convex function composed with an affine function remains convex yields the desired result that the integrand is convex under composition. Additionally, methods are developed using interval arithmetic to derive the exact state bounds for the solution of a linear dynamic system. Given a nonzero tolerance, the method is rigorously shown to converge to the global solution in a finite time. An implementation is developed, and via a collection of case studies, the technique is shown to be very efficient in computing the global solutions. For problems with embedded nonlinear dynamic systems, the analysis requires a more sophisticated composition technique attributed to McCormick. McCormick's composition technique provides a method for computing a convex underestimator for for the integrand given an arbitrary nonlinear dynamic system provided that convex underestimators and concave overestimators can be given for the states. Because the states are known only implicitly via the solution of the nonlinear differential equations, deriving these convex underestimators and concave overestimators is a highly nontrivial task. Based on standard optimization results, outer approximation, the affine solution to linear dynamic systems, and differential inequalities, I present a novel method for constructing convex underestimators and concave overestimators for arbitrary nonlinear dynamic systems ... My thesis focuses on global optimization of nonconvex integral objective functions subject to parameter dependent ordinary differential equations. In particular, efficient, deterministic algorithms are developed for solving problems with both linear and nonlinear dynamics embedded. The techniques utilized for each problem classification are unified by an underlying composition principle transferring the nonconvexity of the embedded dynamics into the integral objective function. This composition, in conjunction with control parameterization, effectively transforms the problem into a finite dimensional optimization problem where the objective function is given implicitly via the solution of a dynamic system. A standard branch-and-bound algorithm is employed to converge to the global solution by systematically eliminating portions of the feasible space by solving an upper bounding problem and convex lower bounding problem at each node. The novel contributions of this work lie in the derivation and solution of these convex lower bounding relaxations. Separate algorithms exist for deriving convex relaxations for problems with linear dynamic systems embedded and problems with nonlinear dynamic systems embedded. However, the two techniques are unified by the method for relaxing the integral in the objective function. I show that integrating a pointwise in time convex relaxation of the original integrand yields a convex underestimator for the integral. Separate composition techniques, however, are required to derive relaxations for the integrand depending upon the nature of the embedded dynamics; each case is addressed separately. For problems with embedded linear dynamic systems, the nonconvex integrand is relaxed pointwise in time by Adam Benjamin Singer. Ph.D. 2005-09-27T17:35:10Z 2005-09-27T17:35:10Z 2004 2004 Thesis http://hdl.handle.net/1721.1/28662 58968295 en_US M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 256 p. 9893380 bytes 9927149 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Chemical Engineering. Singer, Adam B Global dynamic optimization |
| title | Global dynamic optimization |
| title_full | Global dynamic optimization |
| title_fullStr | Global dynamic optimization |
| title_full_unstemmed | Global dynamic optimization |
| title_short | Global dynamic optimization |
| title_sort | global dynamic optimization |
| topic | Chemical Engineering. |
| url | http://hdl.handle.net/1721.1/28662 |
| work_keys_str_mv | AT singeradamb globaldynamicoptimization |