{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:37:38Z","timestamp":1780987058144,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T00:00:00Z","timestamp":1219881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10479-008-0420-4","type":"journal-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T16:18:16Z","timestamp":1219853896000},"page":"73-90","source":"Crossref","is-referenced-by-count":71,"title":["A modified PRP conjugate gradient method"],"prefix":"10.1007","volume":"166","author":[{"given":"Gonglin","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,8,28]]},"reference":[{"key":"420_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"A. Al-baali","year":"1985","unstructured":"Al-baali, A. (1985). Descent property and global convergence of the Fletcher-Reeves method with inexact line search. IMA Journal of Numerical Analysis, 5, 121\u2013124.","journal-title":"IMA Journal of Numerical Analysis"},{"key":"420_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"Armijo, L. (1966). Minimization of functions having Lipschitz conditions partial derivatives. Pacific Journal of Mathematics, 16, 1\u20133.","journal-title":"Pacific Journal of Mathematics"},{"issue":"1","key":"420_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0377-0427(02)00416-8","volume":"146","author":"X. Chen","year":"2002","unstructured":"Chen, X., & Sun, J. (2002). Global convergence of a two-parameter family of conjugate gradient methods without line search. Journal of Computational and Applied Mathematics, 146(1), 37\u201345.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"420_CR4","first-page":"539","volume":"19","author":"Y. Dai","year":"2001","unstructured":"Dai, Y. (2001). Convergence of nonlinear conjugate methods. Journal of Computational Mathematics, 19, 539\u2013549.","journal-title":"Journal of Computational Mathematics"},{"key":"420_CR5","first-page":"139","volume":"15","author":"Y. Dai","year":"2002","unstructured":"Dai, Y. (2002). A nonmonotone conjugate gradient algorithm for unconstrained optimization. Journal of Systems Science and Complexity, 15, 139\u2013145.","journal-title":"Journal of Systems Science and Complexity"},{"issue":"3","key":"420_CR6","first-page":"311","volume":"21","author":"Y. Dai","year":"2003","unstructured":"Dai, Y., & Ni, Q. (2003). Testing different conjugate gradient methods for large-scale unconstrained optimization. Journal of Computational Mathematics, 21(3), 311\u2013320.","journal-title":"Journal of Computational Mathematics"},{"key":"420_CR7","unstructured":"Dai, Y., & Yuan, Y. (1995). Further studies on the Polak-Ribi\u00e8re-Polyak method. Research report ICM-95-040, Institute of Computational Mathematics and Scientific\/Engineering computing, Chinese Academy of Sciences."},{"key":"420_CR8","first-page":"552","volume":"6","author":"Y. Dai","year":"1996","unstructured":"Dai, Y., & Yuan, Y. (1996). Convergence properties of the conjugate descent method. Advances in Mathematics, 6, 552\u2013562.","journal-title":"Advances in Mathematics"},{"key":"420_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y. Dai","year":"2000","unstructured":"Dai, Y., & Yuan, Y. (2000a). A nonlinear conjugate gradient with a strong global convergence properties. SIAM Journal on Optimization, 10, 177\u2013182.","journal-title":"SIAM Journal on Optimization"},{"key":"420_CR10","volume-title":"Nonlinear conjugate gradient methods","author":"Y. Dai","year":"2000","unstructured":"Dai, Y., & Yuan, Y. (2000b). Nonlinear conjugate gradient methods. Shanghai: Science Press of Shanghai."},{"key":"420_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"Y. Dai","year":"2001","unstructured":"Dai, Y., & Yuan, Y. (2001). An efficient hybrid conjugate gradient method for unconstrained optimization. Annals of Operations Research, 103, 33\u201347.","journal-title":"Annals of Operations Research"},{"key":"420_CR12","first-page":"345","volume":"2","author":"Y. Dai","year":"1999","unstructured":"Dai, Y., Han, J., Liu, G., Sun, D., Yin, H., & Yan, Y. (1999). Convergence properties of the nonlinear conjugate methods. SIAM Journal on Optimization, 2, 345\u2013358.","journal-title":"SIAM Journal on Optimization"},{"key":"420_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. D. Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91, 201\u2013213.","journal-title":"Mathematical Programming"},{"key":"420_CR14","volume-title":"Practical method of optimization, Vol\u00a0I: Unconstrained optimization","author":"R. Fletcher","year":"1997","unstructured":"Fletcher, R. (1997). Practical method of optimization, Vol\u00a0I: Unconstrained optimization (2nd ed.). New York: Wiley.","edition":"2"},{"key":"420_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R. Fletcher","year":"1964","unstructured":"Fletcher, R., & Reeves, C. (1964). Function minimization by conjugate gradients. Computer Journal, 7, 149\u2013154.","journal-title":"Computer Journal"},{"key":"420_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J. C. Gibert","year":"1992","unstructured":"Gibert, J. C., & Nocedal, J. (1992). Global convergence properties of conjugate gradient methods for optimization. SIAM Journal on Optimization, 2, 21\u201342.","journal-title":"SIAM Journal on Optimization"},{"key":"420_CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N. I. M. Gould","year":"2003","unstructured":"Gould, N. I. M., Orban, D., Toint, P. L., & CUTEr(and SifDec) (2003). A constrained and unconstrained testing environment, revisited. ACM Transactions on Mathematical Software, 29, 373\u2013394.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"420_CR18","first-page":"84","volume-title":"Mathematical programming: Recent developments and applications","author":"A. Griewank","year":"1989","unstructured":"Griewank, A. (1989). On automatic differentiation. In M. Iri & K. Tanabe (Eds.), Mathematical programming: Recent developments and applications (pp. 84\u2013108). Dordrecht: Kluwer Academic."},{"key":"420_CR19","first-page":"375","volume":"78","author":"L. Grippo","year":"1997","unstructured":"Grippo, L., & Lucidi, S. (1997). A globally convergent version of the Polak-Ribi\u00e8re gradient method. Mathematical Programming, 78, 375\u2013391.","journal-title":"Mathematical Programming"},{"key":"420_CR20","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L. Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., & Lucidi, S. (1986). A nonmonotone line search technique for Newton\u2019s method. SIAM Journal on Numerical Analysis, 23, 707\u2013716.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"420_CR21","first-page":"38","volume":"1","author":"J. Han","year":"2001","unstructured":"Han, J., Liu, G., Sun, D., & Yin, H. (2001). Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications. Acta Mathematicae Applicatae Sinica, 1, 38\u201346.","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"420_CR22","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M. R. Hestenes","year":"1952","unstructured":"Hestenes, M. R., & Stiefel, E. (1952). Method of conjugate gradient for solving linear equations. Journal of Research of National Bureau of Standards, 49, 409\u2013436.","journal-title":"Journal of Research of National Bureau of Standards"},{"key":"420_CR23","first-page":"147","volume":"2","author":"G. Liu","year":"1995","unstructured":"Liu, G., & Han, J. (1995). On the global convergence of conjugate gradient methods with inexact line search. Numerical Mathematics. A\u00a0Journal of Chinese Universities, 2, 147\u2013153.","journal-title":"Numerical Mathematics. A\u00a0Journal of Chinese Universities"},{"key":"420_CR24","first-page":"17","volume":"69","author":"Y. Liu","year":"1992","unstructured":"Liu, Y., & Storey, C. (1992). Efficient generalized conjugate gradient algorithms, part\u00a01: theory. Journal of Optimization Theory and Application, 69, 17\u201341.","journal-title":"Journal of Optimization Theory and Application"},{"key":"420_CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02663897","volume":"10","author":"G. Liu","year":"1995","unstructured":"Liu, G., Han, J., & Yin, H. (1995). Global convergence of the Fletcher-Reeves algorithm with inexact line search. Applied Mathematics. Journal of Chinese Universities Series\u00a0B, 10, 75\u201382.","journal-title":"Applied Mathematics. Journal of Chinese Universities Series\u00a0B"},{"key":"420_CR26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01584328","volume":"13","author":"G. McCormick","year":"1977","unstructured":"McCormick, G. (1977). A modification of Armijo\u2019s step-size rule for negative curvature. Mathematical Programming, 13, 111\u2013115.","journal-title":"Mathematical Programming"},{"key":"420_CR27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J. J. Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J. J., Garbow, B. S., & Hillstrome, K. E. (1981). Testing unconstrained optimization software. ACM Transactions on Mathematical Software, 7, 17\u201341.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"420_CR28","first-page":"199","volume-title":"Acta Numerica","author":"J. Nocedal","year":"1992","unstructured":"Nocedal, J. (1992). Theorem of algorithms for unconstrained optimization. In Acta Numerica (pp. 199\u2013242). Cambridge: Cambridge University Press."},{"key":"420_CR29","first-page":"9","volume-title":"Linear and nonlinear conjugate gradient related methods","author":"J. Nocedal","year":"1995","unstructured":"Nocedal, J. (1995). Conjugate gradient methods and nonlinear optimization. In L. Adams & J. L. Nazareth (Eds.), Linear and nonlinear conjugate gradient related methods (pp. 9\u201323). Philadelphia: SIAM."},{"key":"420_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0663-7","volume-title":"Optimization: Algorithms and consistent approximations","author":"E. Polak","year":"1997","unstructured":"Polak, E. (1997). Optimization: Algorithms and consistent approximations. New York: Springer."},{"issue":"3","key":"420_CR31","first-page":"35","volume":"16","author":"E. Polak","year":"1969","unstructured":"Polak, E., & Ribi\u00e8re, G. (1969). Note sur la convergence de directions conjug\u00e8es. Rev. Francaise Inform. Recherche Operationelle, 16(3), 35\u201343.","journal-title":"Rev. Francaise Inform. Recherche Operationelle"},{"key":"420_CR32","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B. T. Polyak","year":"1969","unstructured":"Polyak, B. T. (1969). The conjugate gradient method in extreme problems. USSR Computational Mathematics and Mathematical Physics, 9, 94\u2013112.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"420_CR33","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"M. J. D. Powell","year":"1977","unstructured":"Powell, M. J. D. (1977). Restart procedures for the conjugate gradient method. Mathematical Programming, 12, 241\u2013254.","journal-title":"Mathematical Programming"},{"key":"420_CR34","first-page":"122","volume-title":"Lecture notes in mathematics","author":"M. J. D. Powell","year":"1984","unstructured":"Powell, M. J. D. (1984). Nonconvex minimization calculations and the conjugate gradient method. In Lecture notes in mathematics (vol.\u00a01066, pp. 122\u2013141). Berlin: Springer."},{"key":"420_CR35","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"M. J. D. Powell","year":"1986","unstructured":"Powell, M. J. D. (1986). Convergence properties of algorithms for nonlinear optimization. SIAM Review, 28, 487\u2013500.","journal-title":"SIAM Review"},{"key":"420_CR36","first-page":"177","volume":"3","author":"H. Qi","year":"1996","unstructured":"Qi, H., Han, J., & Liu, G. (1996). A modification of Hestenes-Stiefel conjugate gradient method. Chinese Annals of Mathematics, 3, 177\u2013184.","journal-title":"Chinese Annals of Mathematics"},{"key":"420_CR37","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.amc.2003.08.058","volume":"157","author":"Z. J. Shi","year":"2004","unstructured":"Shi, Z. J. (2004). Convergence of line search methods for unconstrained optimization. Applied Mathematics and Computation, 157, 393\u2013405.","journal-title":"Applied Mathematics and Computation"},{"key":"420_CR38","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1012903105391","volume":"103","author":"J. Sun","year":"2001","unstructured":"Sun, J., & Zhang, J. (2001). Convergence of conjugate gradient methods without line search. Annals of Operations Research, 103, 161\u2013173.","journal-title":"Annals of Operations Research"},{"key":"420_CR39","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.amc.2005.11.150","volume":"179","author":"Z. Wei","year":"2006","unstructured":"Wei, Z., Li, G., & Qi, L. (2006a). New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. Applied Mathematics and Computation, 179, 407\u2013430.","journal-title":"Applied Mathematics and Computation"},{"key":"420_CR40","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1016\/j.amc.2006.05.150","volume":"183","author":"Z. Wei","year":"2006","unstructured":"Wei, Z., Yao, S., & Liu, L. (2006b). The convergence properties of some new conjugate gradient methods. Applied Mathematics and Computation, 183, 1341\u20131350.","journal-title":"Applied Mathematics and Computation"},{"key":"420_CR41","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/10556789308805532","volume":"2","author":"Y. Yuan","year":"1993","unstructured":"Yuan, Y. (1993). Analysis on the conjugate gradient method. Optimization Methods and Software, 2, 19\u201329.","journal-title":"Optimization Methods and Software"},{"key":"420_CR42","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1093\/imanum\/drl016","volume":"26","author":"Zhang","year":"2006","unstructured":"Zhang et al. (2006). A descent modified Polak-Ribi\u00e8re-Polyak conjugate method and its global convergence. IMA Journal on Numerical Analysis, 26, 629\u2013649.","journal-title":"IMA Journal on Numerical Analysis"},{"key":"420_CR43","first-page":"37","volume-title":"Integer and nonlinear programming","author":"G. Zoutendijk","year":"1970","unstructured":"Zoutendijk, G. (1970). Nonlinear programming computational methods. In J. Abadie (Ed.), Integer and nonlinear programming (pp. 37\u201386). Amsterdam: North-Holland."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0420-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0420-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:49Z","timestamp":1559153269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0420-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,28]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0420-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,28]]}}}