PDF
\(\newcommand{\footnotename}{footnote}\) \(\def \LWRfootnote {1}\) \(\newcommand {\footnote }[2][\LWRfootnote ]{{}^{\mathrm {#1}}}\) \(\newcommand {\footnotemark }[1][\LWRfootnote ]{{}^{\mathrm {#1}}}\) \(\let \LWRorighspace \hspace \) \(\renewcommand {\hspace }{\ifstar \LWRorighspace \LWRorighspace }\) \(\newcommand {\mathnormal }[1]{{#1}}\) \(\newcommand \ensuremath [1]{#1}\) \(\newcommand {\LWRframebox }[2][]{\fbox {#2}} \newcommand {\framebox }[1][]{\LWRframebox } \) \(\newcommand {\setlength }[2]{}\) \(\newcommand {\addtolength }[2]{}\) \(\newcommand {\setcounter }[2]{}\) \(\newcommand {\addtocounter }[2]{}\) \(\newcommand {\arabic }[1]{}\) \(\newcommand {\number }[1]{}\) \(\newcommand {\noalign }[1]{\text {#1}\notag \\}\) \(\newcommand {\cline }[1]{}\) \(\newcommand {\directlua }[1]{\text {(directlua)}}\) \(\newcommand {\luatexdirectlua }[1]{\text {(directlua)}}\) \(\newcommand {\protect }{}\) \(\def \LWRabsorbnumber #1 {}\) \(\def \LWRabsorbquotenumber "#1 {}\) \(\newcommand {\LWRabsorboption }[1][]{}\) \(\newcommand {\LWRabsorbtwooptions }[1][]{\LWRabsorboption }\) \(\def \mathchar {\ifnextchar "\LWRabsorbquotenumber \LWRabsorbnumber }\) \(\def \mathcode #1={\mathchar }\) \(\let \delcode \mathcode \) \(\let \delimiter \mathchar \) \(\def \oe {\unicode {x0153}}\) \(\def \OE {\unicode {x0152}}\) \(\def \ae {\unicode {x00E6}}\) \(\def \AE {\unicode {x00C6}}\) \(\def \aa {\unicode {x00E5}}\) \(\def \AA {\unicode {x00C5}}\) \(\def \o {\unicode {x00F8}}\) \(\def \O {\unicode {x00D8}}\) \(\def \l {\unicode {x0142}}\) \(\def \L {\unicode {x0141}}\) \(\def \ss {\unicode {x00DF}}\) \(\def \SS {\unicode {x1E9E}}\) \(\def \dag {\unicode {x2020}}\) \(\def \ddag {\unicode {x2021}}\) \(\def \P {\unicode {x00B6}}\) \(\def \copyright {\unicode {x00A9}}\) \(\def \pounds {\unicode {x00A3}}\) \(\let \LWRref \ref \) \(\renewcommand {\ref }{\ifstar \LWRref \LWRref }\) \( \newcommand {\multicolumn }[3]{#3}\) \(\require {textcomp}\) \(\newcommand {\intertext }[1]{\text {#1}\notag \\}\) \(\let \Hat \hat \) \(\let \Check \check \) \(\let \Tilde \tilde \) \(\let \Acute \acute \) \(\let \Grave \grave \) \(\let \Dot \dot \) \(\let \Ddot \ddot \) \(\let \Breve \breve \) \(\let \Bar \bar \) \(\let \Vec \vec \) \(\require {mathtools}\) \(\newenvironment {crampedsubarray}[1]{}{}\) \(\newcommand {\smashoperator }[2][]{#2\limits }\) \(\newcommand {\SwapAboveDisplaySkip }{}\) \(\newcommand {\LaTeXunderbrace }[1]{\underbrace {#1}}\) \(\newcommand {\LaTeXoverbrace }[1]{\overbrace {#1}}\) \(\newcommand {\LWRmultlined }[1][]{\begin {multline*}}\) \(\newenvironment {multlined}[1][]{\LWRmultlined }{\end {multline*}}\) \(\let \LWRorigshoveleft \shoveleft \) \(\renewcommand {\shoveleft }[1][]{\LWRorigshoveleft }\) \(\let \LWRorigshoveright \shoveright \) \(\renewcommand {\shoveright }[1][]{\LWRorigshoveright }\) \(\newcommand {\shortintertext }[1]{\text {#1}\notag \\}\) \(\newcommand {\vcentcolon }{\mathrel {\unicode {x2236}}}\) \(\def \T {\mathrm {T}}\)

Stochastic algebraic Riccati equations are almost as easy as deterministic ones

Xin Liang, Zhen-Chen Guo

Abstract

Algebraic Riccati equations (AREs) arise in various models related to control theory, especially in linear-quadratic optimal control design. The deterministic/classical ones are considered for the deterministic linear time-invariant systems, including discrete-time algebraic Riccati equations (DAREs)

\[ X=A^{\T }XA+Q-(A^{\T }XB+L)(R+B^{\T }XB)^{-1}(B^{\T }XA+L^{\T }), \]

and continuous-time algebraic Riccati equations (CAREs)

\[ A^{\T }X+XA+Q-(XB+L)R^{-1}(B^{\T }X+L^{\T })=0. \]

During many years, people have developed rich theoretical results and numerical methods for the DAREs and CAREs. See [22, 21, 18, 3, 16, 2] to obtain an overview for both theories and algorithms.

In comparison, the stochastic/rational ones are considered for the stochastic linear time-invariant systems, including stochastic discrete-time algebraic Riccati equations (SDAREs)

\begin{align*} X=&A_{0}^{\T }XA_{0} + \sum _{i=1}^{r-1} A_i^{\T }XA_i+Q \\ &-(A_{0}^{\T }XB_{0}+\sum _{i=1}^{r-1} A_i^{\T }XB_i+L) (B_{0}^{\T }XB_{0}+\sum _{i=1}^{r-1} B_i^{\T }XB_i+R)^{-1}(B_{0}^{\T }XA_{0}+\sum _{i=1}^{r-1} B_i^{\T }XA_i+L^{\T }), \end{align*} and stochastic continuous-time algebraic Riccati equations (SCAREs)

\begin{align*} &A_{0}^{\T }X+XA_{0} + \sum _{i=1}^{r-1} A_i^{\T }XA_i+Q \\\qquad &-(XB_{0}+\sum _{i=1}^{r-1} A_i^{\T }XB_i+L) (\sum _{i=1}^{r-1} B_i^{\T }XB_i+R)^{-1}(B_{0}^{\T }X+\sum _{i=1}^{r-1} B_i^{\T }XA_i+L^{\T })=0. \end{align*} Here \(r-1\) is the number of stochastic processes involved in the stochastic systems dealt with, and it is easy to check that for the case \(r=1\) SDAREs and SCAREs degenerate to DAREs and CAREs respectively. Due to the complicated forms, we may recognize it would be much more difficult to analyze their properties and obtain their solutions. There are still literature, e.g., [6, 7, 8], discussing the stochastic linear systems and the induced stochastic AREs.

As we can see, the stochastic AREs are still algebraic, and it is quite natural to ask whether algebraic methods could be developed to solve them. However, limited by lack of clear algebraic structures, to the best of the authors’ knowledge, nearly all of the existing algorithms are based on the differentiability or continuity of the equations, such as Newton’s method [6, 5], modified Newton’s method [12, 19, 4], Lyapunov/Stein iterations [9, 20, 24], comparison theorem based method [10, 11], LMI’s (linear matrix inequality) method [23, 17], and homotopy method [25].

The key to the problem is the algebraic structures behind the equations. In this talk, we will build up a simple and clear algebraic interpretation of SDAREs and SCAREs with the help of the so-called left semi-tensor product. In the analysis we find out the Toeplitz structure and the symplectic structure appearing in the equations, and illustrate the fact that the fixed point iteration and the doubling iteration are also valid for them. The algebraic structures found here will shed light on the theoretical analysis and numerical algorithms design, and strongly imply that stochastic AREs are almost as easy as deterministic ones.

As an example, we show how to propose a RADI-type method for large-scale stochastic continuous-time algebraic Riccati equations with sparse and low-rank matrices (\(A_i\) are large-scale and sparse, and \(B_i\) and \(Q-LR^{-1}L^{\T }\) are low-rank), based on revealed algebraic structure and motivated by the relation illustrated in [13] between the algebraic structure and the efficient RADI method [1] for CAREs. Unlike many existing methods for large-scale problems such as Newton-type methods and homotopy method, it calculates the residual at a low cost and does not require a stabilizing initial approximation, which can often be challenging to find. Numerical experiments are provided to demonstrate its efficiency.

This talk is based on [13, 14, 15].

References