Stochastic algebraic Riccati equations are almost as easy as deterministic ones theoretically

TL;DR

This paper will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equations, which guarantees that to solve them is almost as easy as to solve deterministic/classical ones.

Abstract

Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The-state-of-art numerical methods most rely on differentiability or continuity, such as Newton-type method, LMI method, or homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equations. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic.

Theorems & Definitions (16)

• Theorem 2.1: Convergence of fixed point iteration for SDAREs
• proof
• Theorem 2.2: Toeplitz structure in SDAREs
• proof
• Definition 2.1
• Lemma 2.1
• proof
• Lemma 2.2
• proof
• Theorem 2.3: Convergence of doubling iteration for SDAREs