(118b) Improving the Handling of Interval Bounds during Dynamic Global Optimization
AIChE Annual Meeting
2024
2024 AIChE Annual Meeting
Computing and Systems Technology Division
10D: Advances in Computational Methods and Numerical Analysis I
Monday, October 28, 2024 - 12:48pm to 1:06pm
This presentation presents two related refinements [1,2, and under review] to state-of-the-art approaches for computing convex relaxations of ODE solutions, with the ultimate goal of aiding methods for dynamic global optimization. Both of these refinements focus on the relationship between ODE solution relaxations and their related interval bounds. First, we use knowledge of the interval boundsâ correctness to improve the tightness of related ODE solution relaxations, by steering them away from violating the bounds, while maintaining convexity and relaxation validity. Next, we take mathematical techniques that were used to establish correctness of ODE solution relaxations, and adapt these to develop new types of interval bounds on ODE solutions. For example, we obtain new effective interval bounds based on the edge-concave relaxations of Hasan [3]. Numerical examples are presented, and implications are discussed.
References
[1] H Cao and KA Khan, Proceedings of ADCHEM 2021. doi:10.1016/j.ifacol.2021.08.306
[2] H Cao, Ph.D. thesis, McMaster University, 2021. http://hdl.handle.net/11375/27322
[3] MMF Hasan, J. Glob. Optim., 2018. doi:10.1007/s10898-018-0646-x