{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:38:56Z","timestamp":1648661936318},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02248697","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:21:02Z","timestamp":1132028462000},"page":"373-376","source":"Crossref","is-referenced-by-count":0,"title":["A step size rule for unconstrained optimization"],"prefix":"10.1007","volume":"49","author":[{"given":"J.","family":"Rohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02248697_CR1","volume-title":"Practical methods of optimization (Volume 1: Unconstrained optimization)","author":"R. Fletcher","year":"1980","unstructured":"Fletcher, R.: Practical methods of optimization (Volume 1: Unconstrained optimization). New York: Wiley and Sons 1980."},{"key":"BF02248697_CR2","volume-title":"Introduction to linear and nonlinear programming","author":"D. A. Luenberger","year":"1973","unstructured":"Luenberger, D. A.: Introduction to linear and nonlinear programming. Reading, Massachusetts: Addison-Wesley 1973."},{"key":"BF02248697_CR3","volume-title":"Computational methods in optimization: a unified approach","author":"E. Polak","year":"1971","unstructured":"Polak, E.: Computational methods in optimization: a unified approach. New York: Academic Press 1971."},{"key":"BF02248697_CR4","series-title":"Report NI-92-04","volume-title":"Step size rule for unconstrained optimization","author":"J. Rohn","year":"1992","unstructured":"Rohn, J.: Step size rule for unconstrained optimization. Report NI-92-04, Institute for Numerical Analysis, The Technical University of Denmark, Lyngby 1992."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02248697.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02248697\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02248697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:41:30Z","timestamp":1558017690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02248697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02248697"],"URL":"https:\/\/doi.org\/10.1007\/bf02248697","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}