TheoremBase

The Control Riccati Equation with Cross Term: Global Existence and Uniqueness, Positive Semidefiniteness, and the Lyapunov Bound

Under continuous coefficients, a positive definite control weight and the convexity condition that Q - V R−1R^{-1} VTV^T is positive semidefinite, the backward (control) Riccati terminal value problem with cross term has exactly one solution on the whole interval; it is symmetric positive semidefinite and lies below the solution of the backward Lyapunov equation with the reduced coefficients.

Statement

In the setting of Vector- and Matrix-Valued Functions on a Compact Interval: Standing Conventions, let a,b∈Ra,b\in\mathbb{R} with a<ba<b and let n,m∈Nn,m\in\mathbb{N}. Let A,Q:[a,b]→Mn(R)A,Q:[a,b]\to\mathcal{M}_{n}(\mathbb{R}), B,V:[a,b]→Mn×m(R)B,V:[a,b]\to\mathcal{M}_{n\times m}(\mathbb{R}) and R:[a,b]→Mm(R)R:[a,b]\to\mathcal{M}_{m}(\mathbb{R}) be continuous on [a,b][a,b] such that for every t∈[a,b]t\in[a,b], Q(t)Q(t) lies in the set S(n)\mathcal{S}(n) of Euclidean Space and Real Matrices: Standing Notation (iv) and R(t)∈S(m)R(t)\in\mathcal{S}(m) is positive definite, hence invertible (Invertibility of Positive Definite Matrices (i)), with inverse R(t)−1R(t)^{-1} as in Euclidean Space and Real Matrices: Standing Notation (x). Let A~,Q~:[a,b]→Mn(R)\tilde A,\tilde Q:[a,b]\to\mathcal{M}_{n}(\mathbb{R}) be the functions with

A~(t)=A(t)−B(t)R(t)−1V(t)⊤,Q~(t)=Q(t)−V(t)R(t)−1V(t)⊤(t∈[a,b])\tilde A(t)=A(t)-B(t)R(t)^{-1}V(t)^{\top},\qquad\tilde Q(t)=Q(t)-V(t)R(t)^{-1}V(t)^{\top}\qquad\bigl(t\in[a,b]\bigr)

(each Q~(t)\tilde Q(t) lies in S(n)\mathcal{S}(n), by Invertibility of Positive Definite Matrices (ii), Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (vii), Rules for Symmetric and Positive Semidefinite Matrices: Closure, Self-Adjointness, Polarization, Congruence and Cones (v) and Rules for Symmetric and Positive Semidefinite Matrices: Closure, Self-Adjointness, Polarization, Congruence and Cones (i)). Suppose that every Q~(t)\tilde Q(t) is positive semidefinite, let F∈S(n)F\in\mathcal{S}(n) be positive semidefinite, and let ⪯\preceq be the positive semidefinite ordering on S(n)\mathcal{S}(n) of Euclidean Space and Real Matrices: Standing Notation (v).

The terminal value problem of The Riccati Differential Equations of Filtering and Control (ii) with data AA, BB, QQ, VV, RR and FF,

Z′(t)=−(A(t)⊤Z(t)+Z(t)A(t)−(Z(t)B(t)+V(t))R(t)−1(Z(t)B(t)+V(t))⊤+Q(t))(t∈[a,b]),Z(b)=F,Z'(t)=-\Bigl(A(t)^{\top}Z(t)+Z(t)A(t)-\bigl(Z(t)B(t)+V(t)\bigr)R(t)^{-1}\bigl(Z(t)B(t)+V(t)\bigr)^{\top}+Q(t)\Bigr)\quad\bigl(t\in[a,b]\bigr),\qquad Z(b)=F,

has exactly one solution Z:[a,b]→Mn(R)Z:[a,b]\to\mathcal{M}_{n}(\mathbb{R}).

In (ii) and (iii), ZZ is the solution of (i).

For every t∈[a,b]t\in[a,b], Z(t)∈S(n)Z(t)\in\mathcal{S}(n) and Z(t)Z(t) is positive semidefinite.

The functions A~\tilde A and Q~\tilde Q are continuous on [a,b][a,b], by Continuity and Derivative of the Inverse of a Matrix-Valued Map (i), Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (iv), Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v) and Continuity of Projections, Negatives and Differences, and Derivatives on Subintervals (ii). Let Z^:[a,b]→Mn(R)\hat Z:[a,b]\to\mathcal{M}_{n}(\mathbb{R}) be the solution of the terminal value problem of The Lyapunov Differential Equation (ii) with data A~\tilde A, Q~\tilde Q and FF,

Z^′(t)=−(A~(t)⊤Z^(t)+Z^(t)A~(t)+Q~(t))(t∈[a,b]),Z^(b)=F\hat Z'(t)=-\bigl(\tilde A(t)^{\top}\hat Z(t)+\hat Z(t)\tilde A(t)+\tilde Q(t)\bigr)\quad\bigl(t\in[a,b]\bigr),\qquad\hat Z(b)=F

(it exists and is unique by The Lyapunov Differential Equation: Well-Posedness, Representation, Symmetry, Positive Semidefiniteness, Comparison and the Backward Equation (vi), and Z^(t)∈S(n)\hat Z(t)\in\mathcal{S}(n) for every t∈[a,b]t\in[a,b] by The Lyapunov Differential Equation: Well-Posedness, Representation, Symmetry, Positive Semidefiniteness, Comparison and the Backward Equation (viii)). Then Z(t)⪯Z^(t)Z(t)\preceq\hat Z(t) for every t∈[a,b]t\in[a,b].

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…