Lin T Q.Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations[J]. Applied Mathematics and Computation, 2005, 167: 1004-1025.
[2]
Peng Y X, Hu X Y and Zhang L. An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB = C[J]. Applied Mathematics and Computation, 2005, 160: 763-777.
[3]
Salkuyeh D K. CG-type algorithms to solve symmetric matrix equations[J]. Applied Mathematics and Computation, 2006, 172: 985-999.
[4]
Lei Y and Liao A P. A minimal residual algorithm for the inconsistent matrix equation AXB = C over symmetric matrices[J]. Applied Mathematics and Computation, 2007, 188: 499-513.
[5]
Li J F, Hu X Y, Duan X F and Zhang L. Numerical solutions of AXB = C for mirror symmetric matrix X under a specified submatrix constraint[J]. Computing, 2010, 90: 39-56.
[6]
Toutounian F and Karimi S. Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides[J]. Applied Mathematics and Computation, 2006, 178: 452-460.
[7]
Han S P. A successive projective method[J]. Mathematical Programming, 1988, 40: 1-14.
[8]
Boyle J P and Dykstra R L. A method for finding projections onto the intersections of convex sets in Hilbert spaces[J]. Lecture Notes in Statistics, 1986, 37: 28-47.
[9]
Cheney W and Goldstein A. Proximity maps for convex sets[J]. Proceedings of the American Mathematical Society, 1959, 10: 448-450.
[10]
Deutsch F. The method of alternating orthogonal projections. Approximation Theory, Spline Functions and Applications, Kluwer Academic, Dordrecht (1992) 105-121.
[11]
Gubin L G, Polyak B T and Raik E V. The method of peojections for finding the common point of convex sets[J]. USSR Computational Mathematics and Mathematical Physics, 1967, 7: 1-24.
[12]
Bauschke H H and Borwein J M. Dykstra's alternating projection algorithm for two sets, Journal of Approximation Theory, 1994, 79: 418-443.
[13]
Ding F and Chen T W. Gradient Based Iterative Algorithms for Solving a Class of Matrix Equations[J]. IEEE Transactions on Automatic Control, 2005, 50: 1216-1221.
[14]
Jbilou K, Messaoudi A and Sadok H. Global FOM and GMRES algorithms for matrix equations[J]. Applied Numerical Mathematics, 1999, 31: 49-63.
[15]
Peng Z Y. A matrix LSQR iterative method to solve matrix equation AXB = C[J]. International Journal of Computer Mathematics, 2010, 87: 1820-1830.
[16]
Qiu Y Y, Zhang Z Y and Lu J F. Matrix iterative solutions to then least squares problem of BXAT = F with some linear constraints[J]. Applied Mathematics and Computation, 2007, 185: 284-300.
[17]
Peng Z Y. Solutions of symmetry-constrained least-squares problems[J]. Numerical Linear Algebra with Applications, 2008, 15: 373-389.
[18]
曹志浩. 变分迭代法[M]. 科学出版社, 2005.
[19]
Robert O. Numerical methods for solving inverse eigenvalue problems for nonnegative matrices[J]. SIAM Journal on Matrix Analysis and Applications, 2006, 1: 190-212.
[20]
He B S, Liao L Z and Qian M J. Alternating projection based prediction-correction methods for structured variational inequalities[J]. Journal of Computational Mathematics, 2006, 24: 693-710.
[21]
Youla D C and Webb H. Image restoration by the method of convex projection: part I-theory[J]. IEEE Transactions on Medical Imaging, 1982, 2: 81-94.
[22]
Grigoriadis K M and Skelton R S. Alternating convex projection methods for discrete-time covariance control design[J]. Journal of Optimization Theory and Application, 1996, 88: 399-432.
[23]
von Neumann J. Functional Operators. II. The Geometry of Spaces, Annals of Mathematics Studies, vol. 22, Princeton University Press, Princeton, 1950.
[24]
Dykstra R L. An algorithm for restricted least-squares regression[J]. Journal of the American Statistical Association, 1983, 78: 837-842.
