A sufficient descent LS conjugate gradient method for unconstrained optimization problems
暂无分享,去创建一个
[1] Jorge Nocedal,et al. Global Convergence Properties of Conjugate Gradient Methods for Optimization , 1992, SIAM J. Optim..
[2] B. V. Shah,et al. Integer and Nonlinear Programming , 1971 .
[3] Jie Shen,et al. Convergence of Liu-Storey conjugate gradient method , 2007, Eur. J. Oper. Res..
[4] E. Polak,et al. Note sur la convergence de méthodes de directions conjuguées , 1969 .
[5] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..
[6] C. Storey,et al. Efficient generalized conjugate gradient algorithms, part 1: Theory , 1991 .
[7] David J. Thuente,et al. Line search algorithms with guaranteed sufficient decrease , 1994, TOMS.
[8] Nicholas I. M. Gould,et al. CUTE: constrained and unconstrained testing environment , 1995, TOMS.
[9] Boris Polyak. The conjugate gradient method in extremal problems , 1969 .
[10] William W. Hager,et al. A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search , 2005, SIAM J. Optim..
[11] W. Hager,et al. A SURVEY OF NONLINEAR CONJUGATE GRADIENT METHODS , 2005 .
[12] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[13] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[14] Li Zhang. A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems , 2009 .
[15] P. Wolfe. Convergence Conditions for Ascent Methods. II: Some Corrections , 1971 .
[16] P. Wolfe. Convergence Conditions for Ascent Methods. II , 1969 .