POLAK E, RIBIERE G. Note Sur La Convergence de Directions Conjugèes [J]. Revue Francaise Informatique Recherche Operationnelle, 3e Annèe, 1969, 16(3): 35-43.
POLYAK B T. The Conjugate Gradient Method in Extreme Problem [J]. USSR Computational Mathematics and Mathematical Physics, 1969, 9(4): 94-112. doi: 10.1016/0041-5553(69)90035-4
HESTENES M R, STIEFEL E. Method of Conjugate Gradient for Solving Linear Equation [J]. Journal of Research of the National Bureau of Standards, 1952, 49(6): 409-436. doi: 10.6028/jres.049.044
LIU Y, STOREY C. Efficient Generalized Conjugate Gradient Algorithms, Part 1: Theory [J]. Journal of Optimization Theory and Application, 1991, 69(1): 129-137. doi: 10.1007/BF00940464
FLETCHER R, REEVES C. Function Minimization by Conjugate Gradients [J]. The Computer Journal, 1964, 7(12): 149-154.
YUAN G. L, WEI Z X, LI G Y. A Modified Polak-Ribière-Polyak Conjugate Gradient Algorithm for Nonsmooth Convex Programs [J]. Journal of Computational and Applied Mathematics, 2014, 255(1): 86-96.
BONNAN J F, GILBERT J C, LEMARECHAL C, et al. A Family of Variable Metric Proximal Methods [J]. Mathematical Programming, 1995, 68(1): 15-47.
CORREA R, LEMARECHAL C. Convergence of some Algorithms for Convex Minimization [J]. Mathematical Programming, 1993, 62(1): 261-273.
HIRIART-URRUTY J B, LEMARECHAL C. Convex Analysis and Minimization Algorithms Ⅱ [M]. Berlin: Springer, 1993.
FUKUSHIMA M, QI L. A Global and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization [J]. SIAM Journal on Optimization, 1996, 6(4): 1106-1120. doi: 10.1137/S1052623494278839
ZHANG H, HARGER W W. A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization [J]. SIAM Journal on Optimization, 2006, 14(4): 1043-1056.
HAARALA M, MIETTINEN K, MAKELA M M. New Limited Memory Bundle Method for Large-Scale Nonsmooth Optimization [J]. Optimization Methods and Software, 2004, 19(6): 673-692. doi: 10.1080/10556780410001689225