Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem

References

• A.M. Abdel-Rehim, R.B. Morgan, D.A. Nicely, and W. Wilcox, Deflated and restarted symmetric Lanczos methods for eigenvalues and linear equations with multiple right-hand sides, SIAM. J. Sci. Comput. 32(1) (2010), pp. 129–149. doi: 10.1137/080727361
   Web of Science ®Google Scholar
• I. Bongartz, A.R. Conn, N.I.M. Gould, and Ph. L. Toint, CUTE: Constrained and unconstrained testing environment, Report 93/10, Département de Mathématique, Facultés Universitaires de Namur, 1993.
   Google Scholar
• D. Calvetti, L. Reichel, and D.C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal. 2 (1994), pp. 1–21.
   Google Scholar
• A. Chapman and Y. Saad, Deflated and augmented Krylov subspace techniques, Numer. Linear Algebra Appl. 4 (1998), pp. 43–66. doi: 10.1002/(SICI)1099-1506(199701/02)4:1<43::AID-NLA99>3.0.CO;2-Z
   Web of Science ®Google Scholar
• A.R. Conn, N.I.M. Gould, and Ph. L. Toint, Trust-Region Methods, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2000.
   Google Scholar
• T.A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Trans. Math. Soft. 38(1) (2011). Article 1.
   Web of Science ®Google Scholar
• J. Erhel and F. Guyomarc'h, An augmented conjugate gradient method for solving consecutive symmetric positive definite linear systems, SIAM J. Matrix Anal. Appl. 21 (2000), pp. 1279–1299. doi: 10.1137/S0895479897330194
   Web of Science ®Google Scholar
• J.B. Erway and P.E. Gill, An interior method for computing a trust-region step, Numerical Analysis Report 08-1, Department of Mathematics, University of California San Diego, La Jolla, CA, 2008.
   Google Scholar
• J.B. Erway, P.E. Gill, and J.D. Griffin, Iterative methods for finding a trust-region step, Numerical Analysis Report 07-2, Department of Mathematics, University of California San Diego, La Jolla, CA, 2007.
   Google Scholar
• C.A. Floudas, P.M. Pardalos, C.S. Adjiman, W.R. Esposito, Z. Gümüs, S.T. Harding, J.L. Klepeis, C.A. Meyer, and C.A. Schweiger, Handbook of Test Problems for Local and Global Optimization, Kluwer Academic Publishers, Boston, MA, 1999.
   Google Scholar
• N.I.M. Gould, S. Lucidi, M. Roma, and Ph. L. Toint, Solving the trust-region subproblem using the Lanczos method, SIAM J. Optim. 9 (1999), pp. 504–525. doi: 10.1137/S1052623497322735
   Web of Science ®Google Scholar
• N.I.M. Gould, D. Orban, and Ph. L. Toint, CUTEr and SifDec: A constrained and unconstrained testing environment, revisited, ACM Trans. Math. Softw. 29 (2003), pp. 373–394. doi: 10.1145/962437.962439
   Web of Science ®Google Scholar
• M. Gratton, Algorithms for trust-region subproblems with linear inequality constraints, Ph.D. diss., University of North Carolina at Chapel Hill, 2012.
   Google Scholar
• J.D. Griffin, Interior-point methods for large-scale nonconvex optimization, Ph.D. diss., Department of Mathematics, University of California San Diego, 2005.
   Google Scholar
• W.W. Hager, Minimizing a quadratic over a sphere, SIAM J. Optim. 12 (2001), pp. 188–208. doi: 10.1137/S1052623499356071
   Web of Science ®Google Scholar
• W.W. Hager and S. Park, Global convergence of SSM for minimizing a quadratic over a sphere, Math. Comp. 74 (2004), pp. 1413–1423. doi: 10.1090/S0025-5718-04-01731-4
   Web of Science ®Google Scholar
• W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Vol. 187, Springer Verlag, Berlin, Heidelberg and New York, 1981.
   Google Scholar
• R.B. Lehoucq and D.C. Sorensen, Deflation techniques for an implicitly restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl. 17 (1996), pp. 789–821. doi: 10.1137/S0895479895281484
   Web of Science ®Google Scholar
• L. Lukšan, C. Matonoha, and J. Vlcek, A shifted Steihaug–Toint method for computing a trust-region step, Report No. V914-04, Institute of Computer Science, AV CR, Pod Vodarenskou Vezi 2, 18207 Praha 8, Czech Republic, 2004.
   Google Scholar
• J.J. Moré and D.C. Sorensen, Computing a trust region step, SIAM J. Sci. Stat. Comput. 4 (1983), pp. 553–572. doi: 10.1137/0904038
   Web of Science ®Google Scholar
• J. Nocedal and S.J. Wright, Numerical Optimization, Springer-Verlag, New York, 1999.
   Google Scholar
• B.N. Parlett and D.S. Scott, The Lanczos algorithm with selective orthogonalization, Math. Comp. 33 (1979), pp. 217–38. doi: 10.1090/S0025-5718-1979-0514820-3
   Web of Science ®Google Scholar
• M. Rojas, S.A. Santos, and D.C. Sorensen, A new matrix-free algorithm for the large-scale trust-region subproblem, SIAM J. Optim. 11 (2000), pp. 611–646. doi: 10.1137/S105262349928887X
   Web of Science ®Google Scholar
• Y. Saad, M. Yeung, J. Erhel, and F. Guyomarc'h, A deflated version of the conjugate gradient algorithm, SIAM J. Sci. Comput. 21 (2000), pp. 1909–1926. doi: 10.1137/S1064829598339761
   Web of Science ®Google Scholar
• K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Vol. 282, Springer Verlag, Berlin, Heidelberg and New York, 1987.
   Google Scholar
• A. Stathopoulos and K. Orginos, Computing and deflating eigenvalues while solving multiple right-Hand side linear systems with an application to quantum chromodynamics, SIAM. J. Sci. Comput. 32(1) (2010), pp. 439–462. doi: 10.1137/080725532
   Web of Science ®Google Scholar
• T. Steihaug, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal. 20 (1983), pp. 626–637. doi: 10.1137/0720042
   Web of Science ®Google Scholar
• Ph. L. Toint, Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, I. S Duff, ed., Academic Press, London and New York, 1981, pp. 57–88.
   Google Scholar
• K. Wu and H. Simon, Thick-restart Lanczos method for large symmetric eigenvalue problems, SIAM J. Matrix Anal. Appl. 22(2) (2000), pp. 602–616. doi: 10.1137/S0895479898334605
   Web of Science ®Google Scholar
• S. Yektamaram, Optimization algorithms for machine learning designed for parallel and distributed environments, Ph.D. diss., Lehigh University, Bethlehem PA, 2018.
   Google Scholar
• L. Zhang and Zhang C. Shen, A nested Lanczos method for the trust-region subproblem, SIAM J. Sci. Comput. 40(4) (2018), pp. A2005–A2032. doi: 10.1137/17M1145914
   Web of Science ®Google Scholar
• W. Zhou, I. Akrotirianakis, S. Yektamaram, and J. Griffin, A matrix-free line-search algorithm for nonconvex optimization, Optim. Methods. Softw. 34(1) (2019), pp. 1–24. doi: 10.1080/10556788.2017.1332618
   Web of Science ®Google Scholar