2011
DOI: 10.1007/s10898-011-9664-7
|View full text |Cite
|
Sign up to set email alerts
|

Generalized McCormick relaxations

Abstract: Convex relaxations, Global optimization, Optimal control, 49M20, 90C26,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
107
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 82 publications
(108 citation statements)
references
References 26 publications
1
107
0
Order By: Relevance
“…For linear dynamic systems, a method was developed in [61] which provides affine bounds in the parameter space via the solution of an auxiliary set of ODEs. This method was later extended to propagate affine bounds [62] as well as a pair of convex and concave bounds [58,60] for the solutions of parametric nonlinear ODEs based on differential inequalities and (generalized) McCormick relaxations [41,59]. The refinement of reachable set enclosures by accounting for a priori or physical information about a given system was also investigated in [57,61].…”
Section: Introductionmentioning
confidence: 99%
“…For linear dynamic systems, a method was developed in [61] which provides affine bounds in the parameter space via the solution of an auxiliary set of ODEs. This method was later extended to propagate affine bounds [62] as well as a pair of convex and concave bounds [58,60] for the solutions of parametric nonlinear ODEs based on differential inequalities and (generalized) McCormick relaxations [41,59]. The refinement of reachable set enclosures by accounting for a priori or physical information about a given system was also investigated in [57,61].…”
Section: Introductionmentioning
confidence: 99%
“…Similarly by feasibility and (x 1 , x 2 ) is also feasible in (38). It remains to show that the objective function of (38) is an underestimate of (37).…”
Section: Proof Of Propositionmentioning
confidence: 88%
“…Next we show that the optimization problem at the right hand of (38) is a relaxation of the optimization problem at the right hand of (37) and thus has a smaller optimal value. First we will show that any feasible point of (37) is also feasible in (38). Indeed, take any feasible ( x 1 , x 2 ).…”
Section: Proof Of Propositionmentioning
confidence: 98%
See 2 more Smart Citations