{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T01:49:33Z","timestamp":1770688173641,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T00:00:00Z","timestamp":1303257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11590-011-0324-0","type":"journal-article","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T01:24:38Z","timestamp":1303176278000},"page":"941-955","source":"Crossref","is-referenced-by-count":9,"title":["Conjugate gradient methods using value of objective function for unconstrained optimization"],"prefix":"10.1007","volume":"6","author":[{"given":"Hideaki","family":"Iiduka","sequence":"first","affiliation":[]},{"given":"Yasushi","family":"Narushima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,20]]},"reference":[{"key":"324_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"Bongartz I., Conn A.R., Gould N.I.M., Toint P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"324_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00930579","volume":"4","author":"E.E. Cragg","year":"1969","unstructured":"Cragg E.E., Levy A.V.: Study on a supermemory gradient method for the minimization of functions. J. Optim. Theory Appl. 4, 191\u2013205 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"324_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Y.H. Dai","year":"2001","unstructured":"Dai Y.H., Liao L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"324_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y.H. Dai","year":"1999","unstructured":"Dai Y.H., Yuan Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"324_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"Y.H. Dai","year":"2001","unstructured":"Dai Y.H., Yuan Y.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103, 33\u201347 (2001)","journal-title":"Ann. Oper. Res."},{"key":"324_CR6","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.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"324_CR7","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.M.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"324_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10589-007-9087-z","volume":"40","author":"J.A. Ford","year":"2008","unstructured":"Ford J.A., Narushima Y., Yabe H.: Multi-step nonlinear conjugate gradient methods for unconstrained minimization. Comput. Optim. Appl. 40, 191\u2013216 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"324_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J.C. Gilbert","year":"1992","unstructured":"Gilbert J.C., Nocedal J.: Global convergence properties of conjugate gradient method for optimization. SIAM J. Optim. 2, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"324_CR10","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr web site. http:\/\/cuter.rl.ac.uk\/cuter-www\/index.html"},{"key":"324_CR11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W.W. Hager","year":"2005","unstructured":"Hager W.W., Zhang H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"324_CR12","first-page":"35","volume":"2","author":"W.W. Hager","year":"2006","unstructured":"Hager W.W., Zhang H.: A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2, 35\u201358 (2006)","journal-title":"Pacific J. Optim."},{"key":"324_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"W.W. Hager","year":"2006","unstructured":"Hager W.W., Zhang H.: Algorithm 851: CG_DESCENT: a conjugategradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"324_CR14","unstructured":"Hager, W.W., Zhang, H.: CG_DESCENT Version 1.4 User\u2019 Guide, University of Florida, November 2005. http:\/\/www.math.ufl.edu\/~hager\/"},{"key":"324_CR15","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.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"324_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:JOTA.0000012732.62633.59","volume":"120","author":"H.X. Huang","year":"2004","unstructured":"Huang H.X., Liang Z.A., Pardalos P.M.: Flow search approach and new bounds for the m-step linear conjugate gradient algorithm. J. Optim. Theory Appl. 120, 53\u201371 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"324_CR17","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10957-008-9463-6","volume":"140","author":"H. Iiduka","year":"2009","unstructured":"Iiduka H.: Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping. J. Optim. Theory Appl. 140, 463\u2013475 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"324_CR18","unstructured":"Iiduka, H., Uchida, M.: Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints. IEEE Communications Letters (to appear)"},{"key":"324_CR19","doi-asserted-by":"crossref","first-page":"1881","DOI":"10.1137\/070702497","volume":"19","author":"H. Iiduka","year":"2009","unstructured":"Iiduka H., Yamada I.: A use of conjugate gradient direction for the convex optimization problem over the fixed point set of a nonexpansive mapping. SIAM J. Optim. 19, 1881\u20131893 (2009)","journal-title":"SIAM J. Optim."},{"key":"324_CR20","unstructured":"Liu, G., Nocedal, J., Waltz, R.: CG+ web site (1998). http:\/\/users.eecs.northwestern.edu\/~nocedal\/CG+.html"},{"key":"324_CR21","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF00929359","volume":"3","author":"A. Miele","year":"1969","unstructured":"Miele A., Cantrell J.W.: Study on a memory gradient method for the minimization of functions. J. Optim. Theory Appl. 3, 459\u2013470 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"324_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10589-006-8719-z","volume":"35","author":"Y. Narushima","year":"2006","unstructured":"Narushima Y., Yabe H.: Global convergence of a memory gradient method for unconstrained optimization. Comput. Optim. Appl. 35, 325\u2013346 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"324_CR23","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/080743573","volume":"21","author":"Y. Narushima","year":"2011","unstructured":"Narushima Y., Yabe H., Ford J.A.: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization. SIAM J. Optim. 21, 212\u2013230 (2011)","journal-title":"SIAM J. Optim."},{"key":"324_CR24","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00933447","volume":"23","author":"J.L. Nazareth","year":"1977","unstructured":"Nazareth J.L.: A conjugate direction algorithm for unconstrained minimization without line searches. J. Optim. Theory Appl. 23, 373\u2013387 (1977)","journal-title":"J. Optim. Theory Appl."},{"key":"324_CR25","volume-title":"Numerical Optimization (Second Edition)","author":"J. Nocedal","year":"2006","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization (Second Edition). Springer Series in Operations Research, Springer, New York (2006)"},{"key":"324_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Applied Optimization","author":"P.M. Pardalos","year":"2002","unstructured":"Pardalos P.M., Resende M.G.C.: Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"324_CR27","first-page":"35","volume":"16","author":"E. Polak","year":"1969","unstructured":"Polak E., Ribi\u00e8re G.: Note sur la convergence de directions conjug\u00e9es Rev. Francaise Informat Recherche Opertionelle 3e ann\u00e9 16, 35\u201343 (1969)","journal-title":"Francaise Informat Recherche Opertionelle 3e ann\u00e9"},{"key":"324_CR28","first-page":"284","volume":"48","author":"H. Yabe","year":"2005","unstructured":"Yabe H., Sakaiwa N.: A new nonlinear conjugate gradient method for unconstrained optimization. J. Oper. Res. Soc. Japan 48, 284\u2013296 (2005)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"324_CR29","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:COAP.0000026885.81997.88","volume":"28","author":"H. Yabe","year":"2004","unstructured":"Yabe H., Takano M.: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition. Comput. Optim. Appl. 28, 203\u2013225 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"324_CR30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s11590-008-0086-5","volume":"3","author":"G. Yuan","year":"2009","unstructured":"Yuan G.: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems. Optim. Lett. 3, 11\u201321 (2009)","journal-title":"Optim. Lett."},{"key":"324_CR31","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1093\/imanum\/drl016","volume":"26","author":"L. Zhang","year":"2006","unstructured":"Zhang L., Zhou W., Li D.H.: A descent modified Polak-Ribi\u00e8re\u2013Polyak conjugate gradient method and its global convergence. IMA J. Num. Anal. 26, 629\u2013640 (2006)","journal-title":"IMA J. Num. Anal."},{"key":"324_CR32","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s00211-006-0028-z","volume":"104","author":"L. Zhang","year":"2006","unstructured":"Zhang L., Zhou W., Li D.H.: Global convergence of a modified Fletcher\u2013Reeves conjugate gradient method with Armijo-type line search. Numer. Math. 104, 561\u2013572 (2006)","journal-title":"Numer. Math."},{"key":"324_CR33","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L. Zhang","year":"2007","unstructured":"Zhang L., Zhou W., Li D.H.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22, 697\u2013711 (2007)","journal-title":"Optim. Methods Softw."},{"key":"324_CR34","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1080\/10556780500137041","volume":"21","author":"W. Zhou","year":"2006","unstructured":"Zhou W., Zhang L.: A nonlinear conjugate gradient method based on the MBFGS secant condition. Optim. Methods Softw. 21, 707\u2013714 (2006)","journal-title":"Optim. Methods Softw."},{"key":"324_CR35","first-page":"37","volume-title":"Integer and Nonlinear Programming","author":"G. Zoutendijk","year":"1970","unstructured":"Zoutendijk G.: Nonlinear programming. In: Abadie, J. (eds) Integer and Nonlinear Programming, pp. 37\u201386. North-Holland, Amsterdam (1970)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0324-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0324-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0324-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:28Z","timestamp":1559394688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0324-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,20]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["324"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0324-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,20]]}}}