2021
DOI: 10.1007/s10107-021-01654-x
|View full text |Cite
|
Sign up to set email alerts
|

Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 71 publications
0
1
0
Order By: Relevance
“…Within this reduced-space context, researchers have addressed the construction of convex and concave relaxations of factorable functions , (i.e., a function defined by a finite recursive composition of sums, products, and univariate transcendental functions) as well as specific classes of functions that break the factorability assumption. Methods for computing relaxations of parametric solutions of differential equations ,, as well as implicit functions evaluated by fixed-point methods have both been detailed . Provided that relaxations of intermediate terms may be computed, these relaxations may be readily composed in a generalized framework .…”
Section: Optimization Of Hybrid Modelsmentioning
confidence: 99%
“…Within this reduced-space context, researchers have addressed the construction of convex and concave relaxations of factorable functions , (i.e., a function defined by a finite recursive composition of sums, products, and univariate transcendental functions) as well as specific classes of functions that break the factorability assumption. Methods for computing relaxations of parametric solutions of differential equations ,, as well as implicit functions evaluated by fixed-point methods have both been detailed . Provided that relaxations of intermediate terms may be computed, these relaxations may be readily composed in a generalized framework .…”
Section: Optimization Of Hybrid Modelsmentioning
confidence: 99%