{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:17:33Z","timestamp":1776752253548,"version":"3.51.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1972,12,1]],"date-time":"1972-12-01T00:00:00Z","timestamp":92016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1972,12]]},"DOI":"10.1007\/bf01584978","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:06:55Z","timestamp":1114679215000},"page":"101-116","source":"Crossref","is-referenced-by-count":26,"title":["Methods of conjugate directions versus quasi-Newton methods"],"prefix":"10.1007","volume":"3-3","author":[{"given":"Garth P.","family":"McCormick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Ritter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Convergence rates for root finding algorithms","author":"A. Cohen","year":"1970","unstructured":"A. Cohen, \u201cConvergence rates for root finding algorithms,\u201d dissertation. Department of Electrical Engineering, University of California, Berkeley, California, 1970."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0704002","volume":"4","author":"J.W. Daniel","year":"1967","unstructured":"J.W. Daniel, \u201cThe conjugate gradient method for linear and nonlinear programming,\u201dSIAM Journal of Numerical Analysis 4 (1967) 10\u201325.","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"W.C. Davidon, \u201cVariance algorithm for minimization,\u201dThe Computer Journal 10 (1968).","DOI":"10.1093\/comjnl\/10.4.406"},{"key":"CR4","volume-title":"Foundations of modern analysis","author":"J. Dieudonn\u00e9","year":"1960","unstructured":"J. Dieudonn\u00e9,Foundations of modern analysis (Academic Press, New York, 1960)."},{"key":"CR5","volume-title":"\u201cA new approach to variable metric algorithms,\u201d Report No. T.P. 383","author":"R. Fletcher","year":"1969","unstructured":"R. Fletcher, \u201cA new approach to variable metric algorithms,\u201d Report No. T.P. 383, A.E.R.E. Harwell, 1969."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF02162162","volume":"10","author":"A.A. Goldstein","year":"1967","unstructured":"A.A. Goldstein and J.F. Price, \u201cAn effective algorithm for minimization,\u201dNumerische Mathematik 10 (1967) 184\u2013189.","journal-title":"Numerische Mathematik"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"M. Hestenes and E. Stiefel, \u201cMethod of conjugate gradients for solving linear systems,\u201d Report 1659, National Bureau of Standards, 1952.","DOI":"10.6028\/jres.049.044"},{"key":"CR8","first-page":"307","volume-title":"Optimization","author":"G.P. McCormick","year":"1969","unstructured":"G.P. McCormick and J.D. Pearson, \u201cVariable metric methods and unconstrained optimization,\u201d in:Optimization, Ed. R. Fletcher (Academic Press, New York \u2014 London, 1969) pp. 307\u2013326."},{"key":"CR9","volume-title":"\u201cOn the convergence and rate of convergence of the conjugate gradient method,\u201d MRC Report No. 1118","author":"G.P. McCormick","year":"1970","unstructured":"G.P. McCormick and K. Ritter, \u201cOn the convergence and rate of convergence of the conjugate gradient method,\u201d MRC Report No. 1118, Mathematics Research Center, University of Wisconsin, Madison, Wisconsin, December 1970."},{"key":"CR10","volume-title":"\u201cThe projection method for unconstrained optimization,\u201d RAC-TP-425","author":"G.P. McCormick","year":"1971","unstructured":"G.P. McCormick and K. Ritter, \u201cThe projection method for unconstrained optimization,\u201d RAC-TP-425, Research Analysis Corporation, McLean, Virginia, June 1971."},{"key":"CR11","volume-title":"Computational methods in optimization","author":"E. Polak","year":"1971","unstructured":"E. Polak,Computational methods in optimization (Academic Press, New York, 1971)."},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"B.T. Polyak, \u201cThe method of conjugate gradients in extremum problems,\u201dUSSR Computational Mathematics and Mathematical Physics 9, no.4 (1969) 807\u2013821 (in Russian).","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"CR13","volume-title":"\u201cOn the convergence of the variable metric algorithm,\u201d Report No. T.P. 382","author":"M.J.D. Powell","year":"1969","unstructured":"M.J.D. Powell, \u201cOn the convergence of the variable metric algorithm,\u201d Report No. T.P. 382, Theoretical Physics Division, A.E.R.E. Harwell, 1969."},{"key":"CR14","volume-title":"\u201cA new algorithm for unconstrained optimization,\u201d Report No. T.P. 393","author":"M.J.D. Powell","year":"1970","unstructured":"M.J.D. Powell, \u201cA new algorithm for unconstrained optimization,\u201d Report No. T.P. 393, A.E.R.E. Harwell, 1970."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/B978-0-12-597050-1.50010-5","volume-title":"Nonlinear programming","author":"K. Ritter","year":"1970","unstructured":"K. Ritter, \u201cA superlinearly convergent method for unconstrained minimization,\u201d in:Nonlinear programming, Eds. J.B. Rosen, O.L. Mangasarian and K. Ritter (Academic Press, New York \u2014 London, 1970) pp. 177\u2013206."},{"key":"CR16","volume-title":"Variational methods for the study of nonlinear operators","author":"M.M. Vainberg","year":"1964","unstructured":"M.M. Vainberg,Variational methods for the study of nonlinear operators (Holden\u2014Day, San Francisco, California, 1964)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/B978-0-12-597050-1.50008-7","volume-title":"Nonlinear programming","author":"G. Zoutendijk","year":"1970","unstructured":"G. Zoutendijk, \u201cSome algorithms based on the principle of feasible directions,\u201d in:Nonlinear programming, Eds. J.B. Rosen, O.L. Mangasarian and K. Ritter (Academic Press, New York \u2014 London, 1970) pp. 93\u2013122."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584978.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584978\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:51:32Z","timestamp":1586231492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1972,12]]}},"alternative-id":["BF01584978"],"URL":"https:\/\/doi.org\/10.1007\/bf01584978","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,12]]}}}