{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:08:36Z","timestamp":1649200116302},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":[[1990,3]]},"DOI":"10.1007\/bf02247967","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:31:48Z","timestamp":1132029108000},"page":"83-90","source":"Crossref","is-referenced-by-count":4,"title":["An algorithm for solving nonlinear least-squares problems with a new curvilinear search"],"prefix":"10.1007","volume":"44","author":[{"given":"Jos\u00e9 Mario","family":"Mart\u00ednez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita Filomena","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02247967_CR1","unstructured":"J. E. Dennis and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice Hall Series in Comput. Math., Prentice Hall, N. J., 1983."},{"key":"BF02247967_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02239974","volume":"39","author":"J. M. Mart\u00ednez","year":"1987","unstructured":"J. M. Mart\u00ednez, \u201cAn Algorithm for solving Sparse Nonlinear Least-Squares Problems\u201d, Computing39, (1987) pp. 307\u2013325.","journal-title":"Computing"},{"key":"BF02247967_CR3","doi-asserted-by":"crossref","unstructured":"J. M. Mart\u00ednez, \u201cA Family of Quasi-Newton Methods for Nonlinear Equations with Direct Secant Updates of Matrix Factorizations\u201d, SIAM J. Numer. Anal. (1989), to appear.","DOI":"10.1137\/0727061"},{"key":"BF02247967_CR4","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/355934.355943","volume":"7","author":"J. J. Mor\u00e9","year":"1981","unstructured":"J. J. Mor\u00e9, B. S. Garbow and K. E. Hillstrom, \u201cTesting Unconstrained Optimization Software\u201d, ACM TOMS7 (1981) pp. 136\u2013140.","journal-title":"ACM TOMS"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247967.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02247967\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:22:00Z","timestamp":1586557320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02247967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF02247967"],"URL":"https:\/\/doi.org\/10.1007\/bf02247967","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}