{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:32:21Z","timestamp":1776990741788,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:00:00Z","timestamp":1322870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10957-011-9960-x","type":"journal-article","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T18:00:22Z","timestamp":1322935222000},"page":"733-757","source":"Crossref","is-referenced-by-count":75,"title":["Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization"],"prefix":"10.1007","volume":"153","author":[{"given":"Kaori","family":"Sugiki","sequence":"first","affiliation":[]},{"given":"Yasushi","family":"Narushima","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Yabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,3]]},"reference":[{"key":"9960_CR1","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":"9960_CR2","series-title":"Springer Series in Operations Research","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer Series in Operations Research. Springer, New York (2006)","edition":"2"},{"key":"9960_CR3","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 methods for optimization. SIAM J. Optim. 2, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"9960_CR4","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. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9960_CR5","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":"9960_CR6","first-page":"35","volume":"2","author":"W.W. Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"9960_CR7","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A. Perry","year":"1978","unstructured":"Perry, A.: A modified conjugate gradient algorithm. Oper. Res. 26, 1073\u20131078 (1978)","journal-title":"Oper. Res."},{"key":"9960_CR8","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":"9960_CR9","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":"9960_CR10","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":"9960_CR11","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":"9960_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.cam.2009.12.031","volume":"234","author":"M. Kobayashi","year":"2010","unstructured":"Kobayashi, M., Narushima, Y., Yabe, H.: Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems. J. Comput. Appl. Math. 234, 375\u2013397 (2010)","journal-title":"J. Comput. Appl. Math."},{"key":"9960_CR13","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.\u00a0Oper. Res. Soc. Jpn. 48, 284\u2013296 (2005)","journal-title":"J.\u00a0Oper. Res. Soc. Jpn."},{"key":"9960_CR14","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":"9960_CR15","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-Reeves conjugate gradient method with Armijo-type line search. Numer. Math. 104, 561\u2013572 (2006)","journal-title":"Numer. Math."},{"key":"9960_CR16","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\u00e9re-Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629\u2013640 (2006)","journal-title":"IMA J. Numer. Anal."},{"key":"9960_CR17","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":"9960_CR18","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":"9960_CR19","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"J.Z. Zhang","year":"1999","unstructured":"Zhang, J.Z., Deng, N.Y., Chen, L.H.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102, 147\u2013167 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"9960_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0377-0427(00)00713-5","volume":"137","author":"J.Z. Zhang","year":"2001","unstructured":"Zhang, J.Z., Xu, C.X.: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations. J. Comput. Appl. Math. 137, 269\u2013278 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"9960_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"D.H. Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"9960_CR22","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1080\/10556789308805550","volume":"2","author":"J.A. Ford","year":"1993","unstructured":"Ford, J.A., Moghrabi, I.A.: Alternative parameter choices for multi-step quasi-Newton methods. Optim. Methods Softw. 2, 357\u2013370 (1993)","journal-title":"Optim. Methods Softw."},{"key":"9960_CR23","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-0427(94)90309-3","volume":"50","author":"J.A. Ford","year":"1994","unstructured":"Ford, J.A., Moghrabi, I.A.: Multi-step quasi-Newton methods for optimization. J. Comput. Appl. Math. 50, 305\u2013323 (1994)","journal-title":"J. Comput. Appl. Math."},{"key":"9960_CR24","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1080\/01630560701749524","volume":"28","author":"W. Cheng","year":"2007","unstructured":"Cheng, W.: A two-term PRP-based descent method. Numer. Funct. Anal. Optim. 28, 1217\u20131230 (2007)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9960_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s11075-009-9318-8","volume":"53","author":"W. Cheng","year":"2010","unstructured":"Cheng, W., Liu, Q.: Sufficient descent nonlinear conjugate gradient methods with conjugacy condition. Numer. Algorithms 53, 113\u2013131 (2010)","journal-title":"Numer. Algorithms"},{"key":"9960_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00962795","volume":"61","author":"J.E. Dennis Jr.","year":"1989","unstructured":"Dennis, J.E. Jr., Martinez, H.J., Tapia, R.A.: Convergence theory for the structured BFGS secant method with an application to nonlinear least squares. J. Optim. Theory Appl. 61, 161\u2013178 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"9960_CR27","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/0801005","volume":"1","author":"J.R. Engels","year":"1991","unstructured":"Engels, J.R., Martinez, H.J.: Local and superlinear convergence for partially known quasi-Newton methods. SIAM J. Optim. 1, 42\u201356 (1991)","journal-title":"SIAM J. Optim."},{"key":"9960_CR28","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1137\/0804005","volume":"4","author":"J. Huschens","year":"1994","unstructured":"Huschens, J.: On the use of product structure in secant methods for nonlinear least squares problems. SIAM J. Optim. 4, 108\u2013129 (1994)","journal-title":"SIAM J. Optim."},{"key":"9960_CR29","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 environment. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"9960_CR30","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr web site. http:\/\/www.cuter.rl.ac.uk\/"},{"key":"9960_CR31","unstructured":"Hager, W.W., Zhang, H.: CG_DESCENT Version 1.4 User\u2019s Guide. University of Florida (2005). http:\/\/www.math.ufl.edu\/~hager\/"},{"key":"9960_CR32","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 conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"9960_CR33","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":"9960_CR34","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., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"9960_CR35","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"J.J. Mor\u00e9","year":"1994","unstructured":"Mor\u00e9, J.J., Thuente, D.J.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20, 286\u2013307 (1994)","journal-title":"ACM Trans. Math. Softw."},{"key":"9960_CR36","unstructured":"Nocedal, J.: http:\/\/www.ece.northwestern.edu\/~nocedal\/software.html"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9960-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-011-9960-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9960-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:14Z","timestamp":1559469314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-011-9960-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,3]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9960"],"URL":"https:\/\/doi.org\/10.1007\/s10957-011-9960-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,3]]}}}