Solving the quadratic trust-region subproblem in a low-memory BFGS framework

References

• Anderson , E. 1994 . “ LAPACK User's Guide ” . Philadelphia, , PA, USA : SIAM .
   Google Scholar
• Andrei , N. Unconstrained optimization test functions: algebraic expression . Available at: http://www.ici.ro/camo/neculai/SCALCG/testuo.pdf
   Google Scholar
• Axelsson , O. 1996 . “ Iterative Solution Methods ” . Cambridge University Press .
   Google Scholar
• Barzilai , J. and Borwein , J. 1988 . Two point step size gradient method . IMA J. Numer. Anal. , 8 : 141 – 148 .
   Web of Science ®Google Scholar
• Birgin , E. and Martínez , J. 2001 . A spectral conjugate gradient method for unconstrained optimization . Appl. Math. Optim. , 43 : 117 – 128 .
   Web of Science ®Google Scholar
• Birgin , E. , Martínez , J. and Raydan , M. 2000 . Nonmonotone spectral projected gradient methods on convex sets . SIAM J. Optim. , 10 : 1196 – 1211 .
   Web of Science ®Google Scholar
• Borwein , P. and Erdélyi , T. 1995 . “ Polynomials and Polynomial Inequalities, Graduate Texts in Mathematics ” . Vol. 161 , New York : Springer-Verlag .
   Google Scholar
• Byrd , R. and Nocedal , J. 1989 . A tool for the analysis of quasi-Newton methods with application to unconstrained optimization . SIAM J. Numer. Anal. , 26 : 727 – 739 .
   Web of Science ®Google Scholar
• Conn , A. , Gould , N. and Toint , P. 2000 . “ Trust-Region Methods, MPS/SIAM Series on Optimization ” . In SIAM Philadelphia, , PA, USA
   Google Scholar
• Faucette , W. 1996 . A geometric interpretation of the solution of the general quartic polynomial . Amer. Math. Monthly , 103 : 51 – 57 .
   Web of Science ®Google Scholar
• Gay , D. 1981 . Computing optimal locally constrained steps . SIAM J. Sci. Stat. Comput. , 2 : 186 – 197 .
   Web of Science ®Google Scholar
• Gould , N. , Lucidi , S. , Roma , M. and Toint , P. 1999 . Solving the trust-region subproblem using the Lanczos method . SIAM J. Optim. , 9 : 504 – 525 .
   Web of Science ®Google Scholar
• Hager , W. 2001 . Minimizing a quadratic over a sphere . SIAM J. Optim. , 12 : 188 – 208 .
   Web of Science ®Google Scholar
• Hager , W. and Krylyuk , Y. 1999 . Graph partitioning and continuous quadratic programming . SIAM J. Discrete Math. , 12 : 500 – 523 .
   Google Scholar
• Ipsen , I. 1997 . Computing an eigenvector with inverse iteration . SIAM Rev. , 39 : 254 – 291 .
   Google Scholar
• Liu , D. and Nocedal , J. 1989 . On the limited memory BFGS method for large scale optimization . Math. Program. , 45 : 503 – 528 .
   Web of Science ®Google Scholar
• Menke , W. 1989 . “ Geophysical Data Analysis: Discrete Inverse Theory ” . San Diego : Academic Press .
   Google Scholar
• Moré , J. , Garbow , B. and Hillstrom , K. 1981 . Testing unconstrained optimization software . ACM Trans. Math. Softw. , 7 : 17 – 41 .
   Web of Science ®Google Scholar
• Moré , J. and Sorensen , D. 1983 . Computing a trust region step . SIAM J. Sci. Stat. Comput. , 4 : 553 – 572 .
   Web of Science ®Google Scholar
• Nocedal , J. 1980 . Updating quasi-Newton matrices with limited storage . Math. Comput. , 35 : 773 – 782 .
   Web of Science ®Google Scholar
• Nocedal , J. and Wright , S. 1999 . “ Numerical Optimization ” . New York : Springer .
   Google Scholar
• Nocedal , J. and Yuan , Y. 1998 . “ Combining trust region and line search techniques, in Advances in Nonlinear Programming ” . Edited by: Yuan . 153 – 175 . Kluwer, Dordrecht, , The Netherlands
   Google Scholar
• Ouorou , A. 2007 . Implementing a proximal algorithm for some nonlinear multicommodity flow problems . : 18 – 27 . Networks 49
   Google Scholar
• Ouorou , A. 2007 . A proximal subgradient projection algorithm for linearly constrained strictly convex problems . Optim. Methods Softw. , 22 : 617 – 636 .
   Web of Science ®Google Scholar
• Powell , M. 1975 . “ Convergence properties of a class of minimization algorithms, in Nonlinear Programming 2 ” . Edited by: Mangasarian , O. , Meyer , R. and Robinson , S. 1 – 27 . New York : Academic Press .
   Google Scholar
• Raydan , M. 1993 . On the Barzilai and Borwein choice of steplength for the gradient-method . IMA J. Numer. Anal. , 13 : 321 – 326 .
   Web of Science ®Google Scholar
• Raydan , M. 1997 . The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem . SIAM J. Optim. , 7 : 26 – 33 .
   Web of Science ®Google Scholar
• Rendl , F. and Wolkowicz , H. 1997 . A semidefinite framework for trust region subproblems with applications to large scale minimization . Math. Program. , 77 : 273 – 299 .
   Web of Science ®Google Scholar
• Rojas , M. , Santos , S. and Sorensen , D. 2000 . A new matrix-free algorithm for the large-scale trust-region subproblem . SIAM J. Optim. , 11 : 611 – 646 .
   Web of Science ®Google Scholar
• Rojas , M. , Santos , S. and Sorensen , D. 2008 . Algorithm 873: LSTRS: MATLAB software for large-scale trust-region subproblems and regularization . ACM Trans. Math. Softw. , 34 : 1 – 28 .
   Web of Science ®Google Scholar
• Sorensen , D. 1982 . Newton's method with a model trust region modification . SIAM J. Numer. Anal. , 19 : 409 – 426 .
   Web of Science ®Google Scholar
• Steihaug , T. 1983 . The conjugate gradient method and trust regions in large scale optimization . SIAM J. Numer. Anal. , 20 : 626 – 637 .
   Web of Science ®Google Scholar
• Wilkinson , J. 1965 . “ The Algebraic Eigenvalue Problem ” . London : Oxford University Press .
   Google Scholar