Handling Nonpositive Curvature in a Limited Memory Steepest Descent Method
暂无分享,去创建一个
[1] Larry Nazareth,et al. A family of variable metric updates , 1977, Math. Program..
[2] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[3] G. Toraldo,et al. On spectral properties of steepest descent methods , 2013 .
[4] M. Raydan. On the Barzilai and Borwein choice of steplength for the gradient method , 1993 .
[5] Dong Wang,et al. Notes on the Dai-Yuan-Yuan modified spectral gradient method , 2010, J. Comput. Appl. Math..
[6] J. Borwein,et al. Two-Point Step Size Gradient Methods , 1988 .
[7] L. Fox,et al. JOURNAL OF THE INSTITUTE OF MATHEMATICS AND ITS APPLICATIONS , 1977 .
[8] R. Fletcher,et al. A New Approach to Variable Metric Algorithms , 1970, Comput. J..
[9] Nicholas I. M. Gould,et al. CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.
[10] Nicholas I. M. Gould,et al. CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization , 2013, Computational Optimization and Applications.
[11] Jin Yun Yuan,et al. Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization , 2002, Comput. Optim. Appl..
[12] Marcos Raydan,et al. The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem , 1997, SIAM J. Optim..
[13] William W. Hager,et al. An efficient gradient method using the Yuan steplength , 2014, Comput. Optim. Appl..
[14] L. Grippo,et al. A nonmonotone line search technique for Newton's method , 1986 .
[15] Maghsud Solimanpur,et al. Scaling on the Spectral Gradient Method , 2013, J. Optim. Theory Appl..
[16] C. G. Broyden. The Convergence of a Class of Double-rank Minimization Algorithms 2. The New Algorithm , 1970 .
[17] William W. Hager,et al. A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization , 2004, SIAM J. Optim..
[18] D. Shanno. Conditioning of Quasi-Newton Methods for Function Minimization , 1970 .
[19] M. Fukushima,et al. A modified BFGS method and its global convergence in nonconvex minimization , 2001 .
[20] José Luis Morales,et al. A numerical study of limited memory BFGS methods , 2002, Appl. Math. Lett..
[21] Stephen J. Wright,et al. Numerical Optimization , 2018, Fundamental Statistical Inference.
[22] Henk A. van der Vorst,et al. Approximate solutions and eigenvalue bounds from Krylov subspaces , 1995, Numer. Linear Algebra Appl..
[23] Gene H. Golub,et al. Matrix computations , 1983 .
[24] C. G. Broyden. The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .
[25] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .
[26] J. Nocedal. Updating Quasi-Newton Matrices With Limited Storage , 1980 .
[27] L. Liao,et al. R-linear convergence of the Barzilai and Borwein gradient method , 2002 .
[28] Roger Fletcher,et al. A limited memory steepest descent method , 2011, Mathematical Programming.
[29] Ya-xiang,et al. A NEW STEPSIZE FOR THE STEEPEST DESCENT METHOD , 2006 .
[30] D. Goldfarb. A family of variable-metric methods derived by variational means , 1970 .
[31] Saman Babaie-Kafaki,et al. A modified two-point stepsize gradient algorithm for unconstrained minimization , 2013, Optim. Methods Softw..