References
- M.R. Banham and A.K. Katsaggelos, Digital image restoration, IEEE Signal Process Mag. 14(2) (1997), pp. 24–41. doi: 10.1109/79.581363
- M. Bertero and P. Bocacci, Introduction to Inverse Problems in Imaging, Institute of Physics, Bristol, 1998.
- N.I.M. Gould, S. Lucidi, M. Roma, and P.L. Toint, Solving the trust-region subproblem using the Lanczos method, SIAM J. Optim. 9(2) (1999), pp. 504–525. doi: 10.1137/S1052623497322735
- P.C. Hansen, M. Jacobsen, J.M. Rasmussen, and H. Sorensen, The PP-TSVD algorithm for image restoration problems, in Methods and Applications of Inversion, Lecture Notes in Earth Sciences, 92, P.C. Hansen, B.H. Jacobsen, and K. Mosegaard, eds., Spring-Verlag, Berlin, 2000, pp. 171–186.
- G.-x. Huang, F. Yin, and K. Guo, An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB=C, J. Comput. Appl. Math. 212(2) (2008), pp. 231–244. doi: 10.1016/j.cam.2006.12.005
- M. Khorsand Zak and F. Toutounian, Nested splitting conjugate gradient method for matrix equation AXB=C and preconditioning, Comput. Math. Appl. 66(3) (2013), pp. 269–278. doi: 10.1016/j.camwa.2013.05.004
- M.-l. Liang, C.-h. You, and L.-f. Dai, An efficient algorithm for the generalized centro-symmetric solution of matrix equation AXB=C, Numer. Algorithms 44(2) (2007), pp. 173–184. doi: 10.1007/s11075-007-9097-z
- J.J. More and D.C. Sorensen, Computing a trust region step, SIAM J. Sci. Statist. Comput. 4(3) (1983), pp. 553–572. doi: 10.1137/0904038
- Z.-y. Peng, A matrix LSQR iterative method to solve matrix equation AXB=C, Int. J. Comput. Math. 87(8) (2010), pp. 1820–1830. doi: 10.1080/00207160802516875
- Y.-x. Peng, X.-y. Hu, and L. Zhang, A iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB=C, Appl. Math. Comput. 160(3) (2005), pp. 763–777. doi: 10.1016/j.amc.2003.11.030
- Z.-y. Peng, New matrix iterative methods for constraint solutions of the matrix equation AXB=C, J. Comput. Appl. Math. 235(3) (2010), pp. 726–735. doi: 10.1016/j.cam.2010.07.001
- M. Rojas and D.C. Sorensen, A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems, SIAM J. Sci. Comput. 23(6) (2002), pp. 1842–1860. doi: 10.1137/S1064827500378167
- T. Steihaug, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal. 20(3) (1983), pp. 626–637. doi: 10.1137/0720042
- Y. Tian and H. Wang, Relations between least-squares and least-rank solutions of the matrix equation AXB=C, Appl. Math. Comput. 219(20) (2013), pp. 10293–10301. doi: 10.1016/j.amc.2013.03.137
- L. Toint, Towards an Efficient Sparsity Exploiting Newton Method for Minimization, Proceedings of the Conference on Sparse Matrices and their Uses, Academic Press, London, 1981.
- X. Wang, Y. Li, and L. Dai, On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation AXB=C, Comput. Math. Appl. 65(4) (2013), pp. 657–664. doi: 10.1016/j.camwa.2012.11.010