Iterative Algorithms for Symmetric Positive Semidefinite Solutions of the Lyapunov Matrix Equations

Abstract EN

It is well-known that the stability of a first-order autonomous system can be determined by testing the symmetric positive definite solutions of associated Lyapunov matrix equations.

However, the research on the constrained solutions of the Lyapunov matrix equations is quite few.

In this paper, we present three iterative algorithms for symmetric positive semidefinite solutions of the Lyapunov matrix equations.

The first and second iterative algorithms are based on the relaxed proximal point algorithm (RPPA) and the Peaceman–Rachford splitting method (PRSM), respectively, and their global convergence can be ensured by corresponding results in the literature.

The third iterative algorithm is based on the famous alternating direction method of multipliers (ADMM), and its convergence is subsequently discussed in detail.

Finally, numerical simulation results illustrate the effectiveness of the proposed iterative algorithms.