Search

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. [ABSTRACT FROM AUTHOR]

The leader-follower consensus problem of second-order multiagent systems with both absent velocity measurement and time delay is considered. First of all, the consensus protocol is designed by introducing an auxiliary system to compensate for the unavailability of the velocity information. Then, time delay is incorporated into the consensus protocol and two cases with, respectively, constant time delay and time-varying delay are investigated. For the case of constant time delay, Lyapunov-Razumikhin theorem is deployed to obtain the sufficient conditions that guarantee the stability of the consensus algorithm. For the case of time-varying delay, the sufficient conditions are also derived by resorting to the Lyapunov-Razumkhin theorem and linear matrix inequalities (LMIs). Various numerical simulations demonstrate the correctness of the theoretical results. [ABSTRACT FROM AUTHOR]