Conjugate gradients for symmetric positive semidefinite least-squares problems

References

• M. Arioli and S. Gratton, Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method, Comput. Phys. Comm. 183(11) (2012), pp. 2322–2336. doi: 10.1016/j.cpc.2012.05.023
   Web of Science ®Google Scholar
• O. Axelsson, Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, Linear Algebra Appl. 29 (1980), pp. 1–16. doi: 10.1016/0024-3795(80)90226-8
   Web of Science ®Google Scholar
• O. Axelsson, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.
   Google Scholar
• A. Björck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
   Google Scholar
• R. Blaheta, O. Jakl, J. Starý, and K. Krečmer, Schwarz DD method for analysis of geocomposites, in Proceedings of the 12th International Conference on Civil, Structural and Environmental Engineering Computing, B.H.V. Topping, L.F. Costa Neves, and R.C. Barros, eds., Civil-Comp Press, Stirlingshire, Paper 111, 2009, pp. 1–12.
   Google Scholar
• D. Calvetti, B. Lewis, and L. Reichel, On the choice of subspace for iterative methods for linear discrete ill-posed problems, Int. J. Appl. Math. Comput. Sci. 11 (2001), pp. 1069–1092.
   Google Scholar
• D. Calvetti, L. Reichel, and Q. Zhang, Conjugate gradient algorithms for symmetric inconsistent linear systems, in Proceedings of the Lanczos Centenary Conference, M.T. Chu, R.J. Plemmons, J.D. Brown and D.C. Ellison, eds., SIAM, Philadelphia, 1994, pp. 267–272.
   Google Scholar
• S.-C.T. Choi and M.A. Sounders, ALGORITHM 937: MINRES-QLP for singular symmetric and Herminian linear equations and least-squares problems, ACM Trans. Math. Software 40(2) (2014), article 16, pp. 1–12. doi: 10.1145/2527267
   PubMed Web of Science ®Google Scholar
• S.-C.T. Choi, C.C. Paige, and M.A. Saunders, MINRES-QLP: A Krylov subspace method for indefinite or singular symmetric systems, SIAM J. Sci. Comput. 33(4) (2011), pp. 1810–1836. doi: 10.1137/100787921
   Web of Science ®Google Scholar
• Z. Dostál, Optimal Quadratic Programming Algorithms with Applications to Variational Inequalities, 1st ed., Springer US, SOIA 23, New York, 2009.
   Google Scholar
• Z. Dostál and J. Schöberl, Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination, Comput. Optim. Appl. 30(1) (2005), pp. 23–43. doi: 10.1023/B:COAP.0000049888.80264.25
   Web of Science ®Google Scholar
• D.C.-L. Fong and M.A. Saunders, Cg versus MINRES: An empirical comparison, SQU J. Sci. 17(1) (2012), pp. 44–62. doi: 10.24200/squjs.vol17iss1pp44-62
   Google Scholar
• G.H. Golub and C.F. Van Loan, Matrix Computations, 4th ed., John Hopkins University Press, Baltimore, 2013.
   Google Scholar
• M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Natl. Bur. Stand. 49 (1952), pp. 409–436. doi: 10.6028/jres.049.044
   Google Scholar
• T. Heyn, M. Anitescu, A. Tasora, and D. Negrut, Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation, Int. J. Numer. Methods. Eng. 95 (2013), pp. 541–561. doi: 10.1002/nme.4513
   Web of Science ®Google Scholar
• E.F. Kaasschieter, Preconditioned conjugate gradients for solving singular systems, J. Comput. Appl. Math. 24 (1988), pp. 265–275. doi: 10.1016/0377-0427(88)90358-5
   Web of Science ®Google Scholar
• J. Liesen and Z. Strakos, Krylov Subspace Methods, Principles and Analysis, Oxford University Press, Oxford, 2012.
   Google Scholar
• J.C. Mason and D.C. Handscomb, Chebyshev Polynomials, Chapman and Hall/CRC, London, 2002.
   Google Scholar
• A. Neuman, L. Reichel, and H. Sadok, Implementations of range restricted iterative methods for linear discrete ill-posed problems, Linear Algebra Appl. 436(10) (2012), pp. 3974–3990. doi: 10.1016/j.laa.2010.08.033
   Web of Science ®Google Scholar
• C.C. Paige and M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975), pp. 617–629. doi: 10.1137/0712047
   Web of Science ®Google Scholar
• C.C. Paige and M.A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least-squares, ACM Trans. Math. Software 8 (1982), pp. 43–71. doi: 10.1145/355984.355989
   Web of Science ®Google Scholar
• Y. Saad and M.H. Schulz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7 (1986), pp. 856–869. doi: 10.1137/0907058
   Web of Science ®Google Scholar