Abstract
A method is presented for computing convex and concave relaxations of the parametric solutions of nonlinear, semi-explicit, index-one differential-algebraic equations (DAEs). These relaxations are central to the development of a deterministic global optimization algorithm for problems with DAEs embedded. The proposed method uses relaxations of the DAE equations to derive an auxiliary system of DAEs, the solutions of which are proven to provide the desired relaxations. The entire procedure is fully automatable.


Similar content being viewed by others
References
Singer, A.B., Barton, P.I.: Global dynamic optimization for parameter estimation in chemical kinetics. J. Phys. Chem. A 110(3), 971–976 (2006)
Esposito, W.R., Floudas, C.A.: Global optimization for the parameter estimation of differential-algebraic systems. Ind. Eng. Chem. Res. 39, 1291–1310 (2000)
Cizniar, M., Podmajersky, M., Hirmajer, T., Fikar, M., Latifi, A.M.: Global optimization for parameter estimation of differential-algebraic systems. Chem. Pap. 63(3), 274–283 (2009)
Lin, Y., Stadtherr, M.A.: Deterministic global optimization for parameter estimation of dynamic systems. Ind. Eng. Chem. Res. 45, 8438–8448 (2006)
Teo, K.L., Goh, G., Wong, K.: A Unified Computational Approach to Optimal Control Problems. Wiley, New York (1991)
Srinivasan, B., Palanki, S., Bonvin, D.: Dynamic optimization of batch processes—I. Characterization of the nominal solution. Comput. Chem. Eng. 27(1), 1–26 (2003)
Carrasco, E., Banga, J.: Dynamic optimization of batch reactors using adaptive stochastic algorithms. Ind. Eng. Chem. Res. 36(6), 2252–2261 (1997)
Luus, R., Dittrich, J., Keil, F.: Multiplicity of solutions in the optimization of a bifunctional catalyst blend in a tubular reactor. Can. J. Chem. Eng. 70, 780–785 (1992)
Huang, H., Adjiman, C.S., Shah, N.: Quantitative framework for reliable safety analysis. AIChE J. 48(1), 78–96 (2002)
Castiglione, F., Piccoli, B.: Cancer immunotherapy, mathematical modeling and optimal control. J. Theor. Biol. 247, 723–732 (2007)
Martin, R.: Optimal control drug scheduling of cancer chemotherapy. Automatica 28(6), 1113–1123 (1992)
Banga, J., Seider, W.: Global optimization of chemical processes using stochastic algorithms. In: Floudas, C., Pardalos, P. (eds.) State of the Art in Global Optimization: Computational Methods and Applications. Kluwer Academic, Norwell (1996)
Singer, A.B., Barton, P.I.: Global optimization with nonlinear ordinary differential equations. J. Glob. Optim. 34, 159–190 (2006)
Papamichail, I., Adjiman, C.S.: A rigorous global optimization algorithm for problems with ordinary differential equations. J. Glob. Optim. 24(1), 1–33 (2002)
Lin, Y., Stadtherr, M.A.: Deterministic global optimization of nonlinear dynamic systems. AIChE J. 53(4), 866–875 (2007)
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, New York (1996)
Scott, J.K., Chachuat, B., Barton, P.I.: Nonlinear convex and concave relaxations for the solutions of parametric ODEs. Optim. Control Appl. Methods (2012). doi:10.1002/oca.2014
Sahlodin, A.M., Chachuat, B.: Convex/concave relaxations of parametric ODEs using Taylor models. Comput. Chem. Eng. 35, 844–857 (2011)
Sahlodin, A.M., Chachuat, B.: Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs. Appl. Numer. Math. 61, 803–820 (2011)
Bompadre, A., Mitsos, A.: Convergence rate of McCormick relaxations. J. Glob. Optim. 52(1), 1–28 (2012)
Scott, J.K., Barton, P.I.: Interval bounds on the solutions of semi-explicit index-one DAEs. Part 1: Analysis (2011, submitted)
Scott, J.K., Barton, P.I.: Interval bounds on the solutions of semi-explicit index-one DAEs. Part 2: Computation (2011, submitted)
Singer, A.B., Barton, P.I.: Bounding the solutions of parameter dependent nonlinear ordinary differential equations. SIAM J. Sci. Comput. 27, 2167–2182 (2006)
Scott, J.K., Stuber, M.D., Barton, P.I.: Generalized McCormick relaxations. J. Glob. Optim. 51, 569–606 (2011)
Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)
McCormick, G.P.: Computability of global solutions to factorable nonconvex programs. Part I. Convex underestimating problems. Math. Program. 10, 147–175 (1976)
Singer, A.B., Barton, P.I.: Global solution of optimization problems with parameter-embedded linear dynamic systems. J. Optim. Theory Appl. 121, 613–646 (2004)
Neher, M., Jackson, K.R., Nedialkov, N.S.: On Taylor model based integration of ODEs. SIAM J. Numer. Anal. 45(1), 236–262 (2007)
Lin, Y., Stadtherr, M.A.: Validated solutions of initial value problems for parametric ODEs. Appl. Numer. Math. 57, 1145–1162 (2007)
Scott, J.K., Barton, P.I.: Tight, efficient bounds on the solutions of chemical kinetics models. Comput. Chem. Eng. 34, 717–731 (2010)
Mitsos, A., Chachuat, B., Barton, P.I.: McCormick-Based relaxations of algorithms. SIAM J. Optim. 20(2), 573–601 (2009)
Moore, R.E.: Methods and Applications of Interval Analysis. SIAM, Philadelphia (1979)
Hartman, P.: Ordinary Differential Equations, 2nd edn. SIAM, Philadelphia (2002)
Cohen, S.D., Hindmarsh, A.C.: CVODE, a Stiff/Nonstiff ODE solver in C. Comput. Phys. 10(2), 138–143 (1996)
Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems vol. 1. Springer, New York (2003)
Hindmarsh, A.C., Brown, P.N., Grant, K.E., Lee, S.L., Serban, R., Shumaker, D.E., Woodward, C.S.: SUNDIALS, suite of nonlinear and differential/algebraic equation solvers. ACM Trans. Math. Softw. 31, 363–396 (2005)
Acknowledgements
This paper is based on work funded by the National Science Foundation under grant CBET-0933095.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by James Luedtke.
Appendices
Appendix A: Construction of u ψ , o ψ , u f and o f Relaxations
The state relaxations described in this article rely on the ability to compute functions u f , o f , u ψ and o ψ satisfying Definitions 4.8 and 4.6, as well as Assumption 4.1. A method for automatically generating and evaluating such functions based on McCormick’s relaxation technique [26] was described in [24], and was applied to a very similar application, namely relaxing the right-hand side functions of a system of ODEs, in Sect. 7.2 of that article. This section bridges the gap between [24] and the present article by providing precise definitions of the functions u f , o f , u ψ and o ψ through the algorithms defined in [24]. Accordingly, this section is not intended to be independent and should be read alongside [24]. Specifically, the notations \(\mathcal{V}\), \(\tilde{\mathcal{U}}\), \(\tilde{\mathcal{O}}\) and Φ from [24] are used below.
Choose any i∈{1,…,n x }. Then, letting \(\mathcal{V}\) denote the collection of factors v 1,…,v m defining f i (Definition 2.3) and letting the set Φ of Definition 15 in [24] be defined as Φ in Definition 4.3 of the present article, the complete algorithmic construction of the function u f,i is specified by Definition 15 in [24] and the following definitions:

From Definition 15 in [24], the analogous definition of o f,i is apparent. Given these definitions, the composite relaxation properties Definition 4.8 follow directly by construction and the rules of McCormick’s relaxations. The reader is referred to Theorems 8 and 14 in [24] for formal arguments.
The article [24] provides modest conditions (see Theorem 6) on the factorable representation of f (Definition 2.3), which guarantee continuity of u f and o f on \(I\times P\times\mathbb{R}^{n_{x}}\times\mathbb {R}^{n_{x}}\times\mathbb{R}^{n_{y}}\times\mathbb{R}^{n_{y}}\), as well as the global Lipschitz condition of Assumption 4.1 (Condition 3). It is worth noting that these conditions do not imply a global Lipschitz condition on f, but they do imply a much less restrictive local one. Essentially, for fixed (t,p)∈I×P, the global Lipschitz condition on u f and o f is made possible by the intervals X(t) and Y(t). The construction of these functions involves mapping any arguments \((\mathbf{z}_{x}^{c},\mathbf{z}_{x}^{C},\mathbf{z}_{y}^{c},\mathbf {z}_{y}^{C})\in\mathbb {R}^{n_{x}}\times\mathbb{R}^{n_{x}}\times\mathbb{R}^{n_{y}}\times\mathbb {R}^{n_{y}}\) into X(t)×X(t)×Y(t)×Y(t) in a Lipschitz manner (using the \(\operatorname{mid}\) function), so that Lipschitz continuity of u f (t,p,⋅,⋅,⋅,⋅) and o f (t,p,⋅,⋅,⋅,⋅) need only hold on this (compact) interval [24].
Now choose any i∈{1,…,n y } and consider the functions u ψ,i and o ψ,i of Definition 4.6. The definition of these functions is slightly more complicated than that of u f,i and o f,i because ψ i is only factorable with t, and hence C(t), constant. However, if the definition of ψ is modified, call it ψ′, so that \(\hat{\mathbf{C}}\in\mathbb{R}^{n_{y}\times n_{y}}\) is taken as an independent augment and used in place of C(t), then \(\psi_{i}'\) is clearly factorable and defined on

Let \(\mathcal{V}\) denote the corresponding collection of factors v 1,…,v m and denote the elements of C by c i , where \(i\in\{1,\ldots,n_{y}^{2}\}\). Letting the set Φ of Definition 15 in [24] be defined as Φ′ above, the complete algorithmic construction of the function u ψ,i is specified by Definition 15 in [24] and the following definitions:

Again, the analogous definition of o f,i is apparent from Definition 15 in [24]. Given these definitions, the composite relaxation properties of Definition 4.6 follow from the arguments in Theorems 8 and 14 in [24].
Using simple composition rules and finite induction, it follows from the definition of \(\bar{\mathbf{u}}^{K}_{\psi}\) and \(\bar{\mathbf {o}}^{K}_{\psi}\) that the continuity of these functions on \(I\times P\times\mathbb{R}^{n_{x}}\times\mathbb{R}^{n_{x}}\) is a consequence of continuity of u ψ and o ψ on \(I\times P\times\mathbb{R}^{2n_{x}}\times\mathbb{R}^{6n_{y}}\), provided that \(\tilde{\mathbf{y}}\) is chosen as a continuous function on I×P. Similarly, the global Lipschitz condition of Assumption 4.1 (Condition 4) is satisfied provided (u ψ ,o ψ )T is globally Lipschitz with respect to

uniformly on I×P. Since ψ′ is factorable, [24] again provides mild conditions (see Theorem 6) on its factorable form which guarantee continuity of u ψ and o ψ on \(I\times P\times\mathbb{R}^{2n_{x}}\times \mathbb {R}^{6n_{y}}\), provided that C is continuous on I. If C is Lipschitz on I, then the global Lipschitz condition above follows as well. The definition of ψ′ ensures that the required conditions are satisfied by the factorable representation of ψ′, provided they are satisfied by the factorable representations of g and \(\frac{\partial\mathbf{g}}{\partial\mathbf{y}}\) (to assert this, Condition 4 of Assumption 3.2 must be invoked to guarantee that no division by zero occurs in the definition of ψ′). Again, the global Lipschitz condition on u ψ and o ψ (Condition 5 of Assumption 4.1) follows from a weaker local condition and the use of the \(\operatorname{mid}\) function to map any arguments \((\mathbf {z}_{x}^{c},\mathbf{z}_{x}^{C},\mathbf{z}_{y}^{c},\mathbf{z}_{y}^{C},\tilde{\mathbf {z}}_{y}^{c},\tilde {\mathbf{z}}_{y}^{C},\boldsymbol{\lambda}^{c},\boldsymbol{\lambda}^{C})\) in \(\mathbb{R}^{2n_{x}}\times \mathbb{R}^{6n_{y}}\) into the compact interval

in a Lipschitz manner [24].
Appendix B: State Bounds
In this section, the main results in [21, 22] are summarized, culminating in the method used for computing state bounds for (1a)–(1b). The bounds are given as the solution of an auxiliary system of semi-explicit DAEs derived using interval arithmetic and an interval Newton method. To state this system, some preliminaries are required. First, the interval Hansen–Sengupta method is described, which is used for bounding the solutions of nonlinear algebraic equations.
2.1 B.1 The Interval Hansen–Sengupta Method Applied to DAEs
Let \((I,P,Z_{x},Z_{y})\in\mathbb{I}D_{t}\times\mathbb{I}D_{p}\times\mathbb {I}D_{x}\times\mathbb{I}D_{y}\). We are concerned with (i) determining if there exist points z y ∈Z y such that g(t,p,z x ,z y )=0 for some (t,p,z x )∈I×P×Z x , and (ii) computing a refined interval \(Z_{y}'\subset Z_{y}\) which contains all such z y . Conceptually, this is done by using the mean-value theorem. For any \(\mathbf{C}\in\mathbb {R}^{n_{y}\times n_{y}}\) and \(\tilde{\mathbf{z}}_{y}\in Z_{y}\), consider the interval linear system

The solution set of (18) is the set of \(\boldsymbol{\rho}\in\mathbb{R}^{n_{y}}\) such that A ρ=b for some \(\mathbf{A}\in\mathbf {C} [\frac{\partial \mathbf{g}}{\partial\mathbf{y}} ](I,P,Z_{x},Z_{y})\) and \(\mathbf {b}\in-\mathbf {C} [\mathbf{g} ](I,P,Z_{x},\tilde{\mathbf{z}}_{y})\). Applying the mean-value theorem as in the proof of Theorem 4.1, one can easily show the following: Any z y ∈Z y satisfying g(t,p,z x ,z y )=0 for some (t,p,z x )∈I×P×Z x must correspond to an element \((\mathbf{z}_{y}-\tilde{\mathbf{z}}_{y})=\boldsymbol{\rho}\) of the solution set of (18). Thus, we are interested in computing an interval enclosure of this solution set.
For Q⊂ℝ, let hull(Q) denote the interval hull of Q; i.e, the smallest interval containing Q. To state the Hansen–Sengupta method formally, the following definition is useful.
Definition B.1
For all \(A,B,Z\in\mathbb{IR}\), let

The following lemma provides a way to evaluate Γ computationally. See Proposition 4.3.1 in [25] for proof.
Lemma B.1
For all \(A,B,Z\in\mathbb{IR}\),

where B/A denotes interval division,

For any \(A,B,Z\in\mathbb{IR}\), either \(\varGamma(A,B,Z)\in\mathbb {IR}\) or Γ(A,B,Z)=∅. For convenience, the definition of Γ is extended, so that Γ(A,B,Z)=∅ when any of A, B, or Z is empty. Furthermore, we adopt the convention that any arithmetic operation between an element of \(\mathbb{IR}\) and ∅ returns ∅, and any Cartesian product involving ∅ is equivalent to ∅. The following definition generalizes Γ for application to n dimensional linear systems.
Definition B.2
For \(A\in\mathbb{IR}^{n\times n}\), \(B,Z\in\mathbb{IR}^{n}\), define Γ(A,B,Z):=W 1×⋯×W n , where

Applying Γ to (18) gives the following variant of the well-known result Theorem 5.1.8 in [25], proven in [21].
Corollary B.1
Let \((I,P,Z_{x},Z_{y})\in\mathbb{I}D_{t}\times\mathbb{I}D_{p}\times\mathbb {I}D_{x}\times\mathbb{I}D_{y}\), \(\tilde{\mathbf{z}}_{y}\in Z_{y}\), \(\mathbf {C}\in\mathbb{R}^{n_{y}\times n_{y}}\) and define

With \(Z_{y}':=\mathcal{H}(I,P,Z_{x},Z_{y},\tilde{\mathbf{z}}_{y},\mathbf {C})\), the following conclusions hold:
-
1.
If (t,p,z x ,z y )∈I×P×Z x ×Z y satisfies g(t,p,z x ,z y )=0, then \(\mathbf{z}_{y}\in Z_{y}'\).
-
2.
If \(Z_{y}'=\emptyset\), then \(\not\exists(t,\mathbf{p},\mathbf {z}_{x},\mathbf {z}_{y})\in I\times P\times Z_{x}\times Z_{y}\) such that g(t,p,z x ,z y )=0.
-
3.
If \(\tilde{\mathbf{z}}_{y}\in\operatorname{int}(Z_{y})\) and \(\emptyset \neq Z_{y}'\subset\operatorname{int}(Z_{y})\), then \(\exists\mathbf{H}\in C^{1}(I\times P\times Z_{x},Z_{y}')\) such that, for every point (t,p,z x ) in I×P×Z x , z y =H(t,p,z x ) is the unique element of Z y satisfying g(t,p,z x ,z y )=0. Moreover, the interval matrix \(\mathbf{C} [\frac {\partial\mathbf{g}}{\partial\mathbf{y}} ](I,P,Z_{x},Z_{y})\) does not contain a singular matrix and does not contain zero in any of its diagonal elements.
The following theorem is a key result from [21].
Theorem B.1
Let \((I,P,Z_{x},Z_{y})\in\mathbb{I}D_{t}\times\mathbb{I}D_{p}\times\mathbb {I}D_{x}\times\mathbb{I}D_{y}\), \(\tilde{\mathbf{z}}_{y}\in Z_{y}\), \(\mathbf {C}\in\mathbb{R}^{n_{y}\times n_{y}}\), and define \(\mathcal {H}(I,P,Z_{x},Z_{y},\tilde{\mathbf{z}}_{y},\mathbf{C})\) as in Corollary B.1. Furthermore, let \(X_{0}\in\mathbb{IR}^{n_{x}}\) satisfy x 0(P)⊂X 0 and denote I=[t 0,t f ]. If the inclusions



hold, then there exists a regular solution of (1a)–(1b) on I×P satisfying \((\mathbf{x}(t,\mathbf{p}), \mathbf {y}(t,\mathbf{p}))\in Z_{x}\times\ Z_{y}'\) for all (t,p)∈I×P. Furthermore, for any connected set \(\tilde{I}\subset I\) containing t 0, any connected set \(\tilde{P}\subset P\), and any solution (x ∗,y ∗) of (1a)–(1b) on \(\tilde{I}\times\tilde{P}\), either (x ∗,y ∗)=(x,y) on \(\tilde{I}\times\tilde{P}\), or y ∗(t 0,p)∉Z y , \(\forall\mathbf{p}\in\tilde{P}\).
2.2 B.2 Further Definitions
The bounding method of [21, 22] requires some further definitions related to the interval Hansen–Sengupta method.
Definition B.3
Let \(\widetilde{\cap}:\mathbb{IR}^{n}\times\mathbb{IR}^{n}\rightarrow \mathbb{IR}^{n}\) be defined by
Furthermore, define the standard notation \(Z\,\widetilde{\cap}\,\hat {Z}:=\widetilde{\bigcap}(Z,\hat{Z})\), \(\forall Z,\hat{Z}\in\mathbb{IR}^{n}\).
The following definition describes modified forms of Γ used below.
Definition B.4
Let \(\mathcal{D}^{*} := \{(A,B,Z)\in\mathbb{IR}^{n\times n}\times \mathbb{IR}^{n}\times\mathbb{IR}^{n}: 0\not\in A_{ii}, \forall i=1,\ldots,n\}\) and define \(\varGamma^{*},\varGamma^{+}:\mathcal {D}^{*}\rightarrow\mathbb{IR}^{n}\) by \(\varGamma^{*}(A,B,Z):= W^{*}_{1}\times \cdots\times W^{*}_{n}\) and \(\varGamma^{+}(A,B,Z):= W^{+}_{1}\times\cdots \times W^{+}_{n_{y}}\), where


The following definition formalizes the notation \(\mathcal{H}\) from Corollary B.1, with a slight modification to reflect the fact that, in the method presented below, the reference point \(\tilde {\mathbf{z}}_{y}\) is taken as the midpoint of Z y and does not need to be specified independently. Notation is also introduced for iterative application of \(\mathcal{H}\), and extended forms based on Γ + and Γ ∗ are defined.
Definition B.5
Define \(M_{\varGamma}:\mathbb{I}D_{t}\times\mathbb{I}D_{p}\times\mathbb {I}D_{x}\times\mathbb{I}D_{y}\times\mathbb{IR}^{n_{y}\times n_{y}}\rightarrow\mathbb{IR}^{n_{y}\times n_{y}}\times\mathbb {IR}^{n_{y}}\times\mathbb{IR}^{n_{y}}\) by

and define the set

For every K∈ℕ, define the function \(\mathcal {H}^{K}:\mathbb{I}D_{t}\times\mathbb{I}D_{p}\times\mathbb{I}D_{x}\times \mathbb{I}D_{y}\times\mathbb{IR}^{n_{y}\times n_{y}}\rightarrow\mathbb {IR}^{n_{y}}\) by \(\mathcal{H}^{K}(I,P,Z_{x},Z_{y}^{0},\mathbf{C}):= Z_{y}^{K}\), where \(Z_{y}^{k+1}=m(Z^{k}_{y})+\varGamma (M_{\varGamma}(I,P, Z_{x},Z^{k}_{y},\mathbf {C}) )\), for every k in {0,…,K−1}. Furthermore, define \(\mathcal{H}^{+,K}:\mathcal{D}_{\mathcal{H}}^{*}\rightarrow \mathbb{IR}^{n_{y}}\) exactly as \(\mathcal{H}^{K}\) with Γ + in place of Γ, and define \(\mathcal{H}^{*}:\mathcal{D}_{\mathcal {H}}^{*}\rightarrow\mathbb{IR}^{n_{y}}\) exactly as \(\mathcal{H}^{1}\) with Γ ∗ in place of Γ.
2.3 B.3 State Bounds as the Solutions of an Auxiliary System of DAEs
Definition B.6
Let \(\Box:\mathbb{R}^{n}\times\mathbb{R}^{n}\rightarrow\mathbb{IR}^{n}\) be defined by

Definition B.7
Let \(\mathcal{B}_{i}^{L},\mathcal{B}_{i}^{U}:\mathbb{IR}^{n_{x}}\rightarrow \mathbb{IR}^{n_{x}}\) be defined by \(\mathcal{B}_{i}^{L}([\mathbf {v},\mathbf {w}])=\{\mathbf{z}\in[\mathbf{v},\mathbf{w}]: z_{i}=v_{i}\}\) and \(\mathcal {B}_{i}^{U}([\mathbf{v},\mathbf{w}])=\{\mathbf{z}\in[\mathbf {v},\mathbf{w}]: z_{i}=w_{i}\}\), for every i=1,…,n x .
We are now prepared to state an auxiliary system of DAEs describing state bounds. Let I=[t 0,t f ]⊂D t , P⊂D p and X 0⊂D x be intervals and suppose that x 0(P)⊂X 0. For every i∈{1,…,n x }, let





where





Choosing any K∈ℕ, define the functions in (27)–(31) by









For any continuous and pointwise positive γ:I→ℝ, consider the initial value problem in DAEs




for all i=1,…,n x , with initial conditions

In (48) and (49), \(\mathcal{H}^{*,L}\) and \(\mathcal{H}^{*,U}\), denote the lower and upper bounds of \(\mathcal{H}^{*}\), respectively. A solution of (46)–(50) is any \(\mathbf {v},\mathbf{w}:I\rightarrow\mathbb{R}^{n_{x}}\) and \(\mathbf {z}_{y}^{L},\mathbf {z}_{y}^{U}:I\rightarrow\mathbb{R}^{n_{y}}\) satisfying (46)–(50) for all t∈I, with v and w continuously differentiable and \(\mathbf {z}_{y}^{L}\) and \(\mathbf{z}_{y}^{U}\) piecewise C 1 (see [35] for a definition of this class of functions). The main result of [22], stated below, shows that any such solution provides state bounds for a unique regular solution of (1a)–(1b) on I×P. The results below require that the interval extensions [f], [g] and \([\frac{\partial\mathbf {g}}{\partial\mathbf {y}}]\) are piecewise C 1, which is defined and discussed in detail in [22]. In the remainder of this section, we use the notation \(Z_{y}(t):=[\mathbf{z}_{y}^{L}(t),\mathbf{z}_{y}^{U}(t)]\) and \(Z_{y}'(t):=\mathcal {H}^{*}(\phi(t,\mathbf{v}(t),\mathbf{w}(t),\mathbf {z}_{y}^{L}(t),\mathbf{z}_{y}^{U}(t)))\).
Lemma B.2
Let \((\mathbf{v},\mathbf{w},\mathbf{z}_{y}^{L},\mathbf{z}_{y}^{U})\) be a solution of (46)–(50) on I and define

Then
-
1.
\([\mathbf{v}(t),\mathbf{w}(t)]\times Z_{y}(t)\in\mathbb {I}D_{x}\times \mathbb{I}D_{y}\), ∀t∈I.
-
2.
There exists H∈C 1(V,D y ) such that, for every (t,p,z x )∈V, z y =H(t,p,z x ) is an element of \(Z_{y}'(t)\) and satisfies g(t,p,z x ,z y )=0 uniquely among elements of Z y (t).
-
3.
For every t∈I, the interval matrix
does not contain any singular matrix and does not contain zero in any of its diagonal elements.
Theorem B.2
Let \((\mathbf{v},\mathbf{w},\mathbf{z}_{y}^{L},\mathbf{z}_{y}^{U})\) be a solution of (46)–(50) on I. Then there exists a regular solution (x,y) of (1a)–(1b) on I×P satisfying


for all (t,p)∈I×P and any q∈ℕ. Furthermore, for any connected \(\tilde{I}\subset I\) containing t 0, any connected \(\tilde{P}\subset P\), and any solution (x ∗,y ∗) of (1a)–(1b) on \(\tilde{I}\times\tilde{P}\), either (x ∗,y ∗)=(x,y) on \(\tilde {I}\times\tilde {P}\), or y ∗(t 0,p)∉Z y (t 0), \(\forall \mathbf{p}\in \tilde{P}\).
In light of Theorem B.2, state bounds are given by simply solving the DAEs (46)–(50). Provided that numerical error is not a critical concern, this can be done using any state-of-the-art DAE solver. For the numerical example in Sect. 5, the code IDA [36] was used with absolute and relative tolerances of 10−6. Furthermore, K=5 and γ(t)=10−5, ∀t∈I.
Rights and permissions
About this article
Cite this article
Scott, J.K., Barton, P.I. Convex and Concave Relaxations for the Parametric Solutions of Semi-explicit Index-One Differential-Algebraic Equations. J Optim Theory Appl 156, 617–649 (2013). https://doi.org/10.1007/s10957-012-0149-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-012-0149-8