论文信息 - A efficient algorithm for the discrete-time LQR optimal control problem - 字舞流文

A efficient algorithm for the discrete-time LQR optimal control problem

In this paper, a new efficient algorithm is proposed to the discrete-time LQR optimal control problem. And a perturbation bound for the solution is derived.

Yang Liu | Xiaolong Li

[1] Salah M. El-Sayed,et al. A new inversion free iteration for solving the equation X+A* X -1 A=Q , 2005 .

[2] Mohamed A. Ramadan,et al. On the existence of a positive definite solution of the matrix equation , 2001, Int. J. Comput. Math..

[3] Leiba Rodman,et al. A Perturbation Analysis for Nonlinear Selfadjoint Operator Equations , 2006, SIAM J. Matrix Anal. Appl..

[4] Shu-Fang Xu,et al. Perturbation analysis of the maximal solution of the matrix equation X+A∗X−1A=P , 2001 .

[5] Xingzhi Zhan,et al. Computing the Extremal Positive Definite Solutions of a Matrix Equation , 1996, SIAM J. Sci. Comput..

[6] Chun-Hua Guo,et al. Iterative solution of two matrix equations , 1999, Math. Comput..

[7] Salah M. El-Sayed. An algorithm for computing positive definite solutions of the nonlinear matrix equation X + A*X −1 A = I , 2003, Int. J. Comput. Math..