{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:05:20Z","timestamp":1750176320556},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1007\/bf01583799","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:31:20Z","timestamp":1114662680000},"page":"349-352","source":"Crossref","is-referenced-by-count":11,"title":["A note on a sufficient-decrease criterion for a non-derivative step-length procedure"],"prefix":"10.1007","volume":"23","author":[{"given":"Philip E.","family":"Gill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Murray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margaret H.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"313","volume":"14","author":"M. Altman","year":"1966","unstructured":"M. Altman, \u201cGeneralized gradient methods of minimizing a functional\u201d,Bulletin de l'Academie Polonaise des Sciences. S\u00e9rie des Sciences Math\u00e9matiques, Astronomiques et Physiques 14 (1966) 313\u2013318.","journal-title":"Bulletin de l'Academie Polonaise des Sciences. S\u00e9rie des Sciences Math\u00e9matiques, Astronomiques et Physiques"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R. Fletcher","year":"1970","unstructured":"R. Fletcher, \u201cA new approach to variable metric algorithms\u201d,Computer Journal 13 (1970) 317\u2013322.","journal-title":"Computer Journal"},{"key":"CR3","volume-title":"\u201cSafeguarded steplength algorithms for optimization using descent methods\u201d, Tech. Rept. NAC 37","author":"P.E. Gill","year":"1974","unstructured":"P.E. Gill and W. Murray, \u201cSafeguarded steplength algorithms for optimization using descent methods\u201d, Tech. Rept. NAC 37, National Physical Laboratory, Teddington, England (1974)."},{"key":"CR4","volume-title":"\u201cTwo steplength algorithms for numerical optimization\u201d, Tech. Rept. SOL 79-25","author":"P.E. Gill","year":"1979","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cTwo steplength algorithms for numerical optimization\u201d, Tech. Rept. SOL 79-25, Department of Operations Research, Stanford University, Stanford, CA (1979)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF02162162","volume":"10","author":"A. Goldstein","year":"1967","unstructured":"A. Goldstein and J. Price, \u201cAn effective algorithm for minimization\u201d,Numerische Mathematik 10 (1967) 184\u2013189.","journal-title":"Numerische Mathematik"},{"key":"CR6","volume-title":"Iterative solution of nonlinear equations in several variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, London, 1970)."},{"key":"CR7","first-page":"117","volume-title":"Optimization in action","author":"M.J.D. Powell","year":"1976","unstructured":"M.J.D. Powell, \u201cA view of unconstrained optimization\u201d, in: L.C.W. Dixon, ed.,Optimization in action (Academic Press, London, 1976) pp. 117\u2013152."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P. Wolfe","year":"1969","unstructured":"P. Wolfe, \u201cConvergence conditions for ascent methods\u201d,SIAM Review 11 (1969) 226\u2013235.","journal-title":"SIAM Review"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583799.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01583799\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:29:24Z","timestamp":1556882964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01583799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01583799"],"URL":"https:\/\/doi.org\/10.1007\/bf01583799","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}