A kinematic smoothing method for tightening convex relaxations of ordinary differential equations

This article presents a new approach for constructing convex enclosures of reachable sets of parametric ordinary differential equations (ODEs), for use in deterministic methods for global dynamic optimization. In our new approach, we modify an established ODE relaxation framework by Scott and Barton (2013), using kinematic intuition to replace certain discontinuous transitions between discrete modes with tighter, smoother transitions, and ultimately producing tighter, smoother relaxations of the original ODE solution that are more amenable to integration by off-the-shelf numerical ODE solvers. We refer to our new relaxation approach as “kinematic smoothing”. Our new ODE relaxations are straightforward to construct automatically based on established tools, and we present several numerical examples based on a proof-of-concept implementation in Julia.

Authors

Institutions

Publication Details

Journal
Journal of Global Optimization
Published
2025-12-20
DOI
https://doi.org/10.1007/s10898-025-01579-1
Citations
2
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
5.26

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A kinematic smoothing method for tightening convex relaxations of ordinary differential equations

Huiyi Cao, Kamil A. Khan
2 citations
Journal of Global Optimization
Advanced Optimization Algorithms Research
5.26
article

A kinematic smoothing method for tightening convex relaxations of ordinary differential equations

Huiyi Cao, Kamil A. Khan
article en
2 citations

Abstract

This article presents a new approach for constructing convex enclosures of reachable sets of parametric ordinary differential equations (ODEs), for use in deterministic methods for global dynamic optimization. In our new approach, we modify an established ODE relaxation framework by Scott and Barton (2013), using kinematic intuition to replace certain discontinuous transitions between discrete modes with tighter, smoother transitions, and ultimately producing tighter, smoother relaxations of the original ODE solution that are more amenable to integration by off-the-shelf numerical ODE solvers. We refer to our new relaxation approach as “kinematic smoothing”. Our new ODE relaxations are straightforward to construct automatically based on established tools, and we present several numerical examples based on a proof-of-concept implementation in Julia.

Journal of Global OptimizationVol. 94(1)
McMaster University (CA)
McMaster University, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 4%
Advanced Optimization Algorithms Research
5.26
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.