The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation

In this paper, we present an accelerated gradient based algorithm by minimizing certain criterion quadratic function for solving the generalized Sylvester-transpose matrix equation AXB + CXT D = F. The idea is from (Ding and Chen, 2005; Niu et al., 2011; Wang et al., 2012) in which some efficient algorithms were developed for solving the Sylvester matrix equation and the Lyapunov matrix equation. On the basis of the information generated in the previous half-step, we further introduce a relaxation factor to obtain the solution of the generalized Sylvester-transpose matrix equation. We show that the iterative solution converges to the exact solution for any initial value provided that some appropriate assumptions. Finally, some numerical examples are given to illustrate that the introduced iterative algorithm is efficient. (C) 2015 Elsevier Inc. All rights reserved.