{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:40:29Z","timestamp":1742978429372,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031229893"},{"type":"electronic","value":"9783031229909"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22990-9_1","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Derivative-Free Nonlinear Least Squares Solver"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1451-1632","authenticated-orcid":false,"given":"Igor","family":"Kaporin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Averick, B.M., Carter, R.G., Xue, G.L., More, J.J.: The MINPACK-2 test problem collection (No. ANL\/MCS-TM-150-Rev.) Argonne National Lab., IL (United States) (1992)","DOI":"10.2172\/79972"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/0724031","volume":"24","author":"PN Brown","year":"1987","unstructured":"Brown, P.N.: A local convergence theory for combined inexact-Newton\/finite-difference projection methods. SIAM J. Numer. Anal. 24(2), 407\u2013434 (1987)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0911026","volume":"11","author":"PN Brown","year":"1990","unstructured":"Brown, P.N., Saad, Y.: Hybrid Krylov methods for nonlinear systems of equations. SIAM J. Sci. Stat. Comput. 11(3), 450\u2013481 (1990)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0804017","volume":"4","author":"PN Brown","year":"1994","unstructured":"Brown, P.N., Saad, Y.: Convergence theory of nonlinear Newton-Krylov algorithms. SIAM J. Optim. 4(2), 297\u2013330 (1994)","journal-title":"SIAM J. Optim."},{"key":"1_CR6","unstructured":"Kaporin, I.E.: Esimating global convergence of inexact Newton methods via limiting stepsize along normalized direction, report 9329. Department of Mathematics, Catholic University of Nijmegen, Nijmegen, The Netherlands, p. 8 (1993)"},{"issue":"3","key":"1_CR7","first-page":"26","volume":"15","author":"IE Kaporin","year":"1995","unstructured":"Kaporin, I.E.: The use of preconditioned Krylov subspaces in conjugate gradient type methods for the solution of nonlinear least square problems (Russian). Vestnik Mosk. Univ. Ser. (Computational Math. Cybernetics) 15(3), 26\u201331 (1995)","journal-title":"Vestnik Mosk. Univ. Ser. (Computational Math. Cybernetics)"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1137\/0916015","volume":"16","author":"IE Kaporin","year":"1994","unstructured":"Kaporin, I.E., Axelsson, O.: On a class of nonlinear equation solvers based on the residual norm reduction over a sequence of affine subspaces. SIAM J. Sci. Comput. 16(1), 228\u2013249 (1994)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1515\/comp-2020-0012","volume":"10","author":"I Kaporin","year":"2020","unstructured":"Kaporin, I.: Preconditioned subspace descent method for nonlinear systems of equations. Open Comput. Sci. 10(1), 71\u201381 (2020)","journal-title":"Open Comput. Sci."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-030-91059-4_16","volume-title":"Optimization and Applications","author":"I Kaporin","year":"2021","unstructured":"Kaporin, I.: A derivative-free nonlinear least squares solver. In: Olenev, N.N., Evtushenko, Y.G., Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V. (eds.) OPTIMA 2021. LNCS, vol. 13078, pp. 217\u2013230. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91059-4_16"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1134\/S0965542510060011","volume":"50","author":"VA Kazeev","year":"2010","unstructured":"Kazeev, V.A., Tyrtyshnikov, E.E.: Structure of the Hessian matrix and an economical implementation of Newton\u2019s method in the problem of canonical approximation of tensors. Comput. Math. Math. Phys. 50(6), 927\u2013945 (2010). https:\/\/doi.org\/10.1134\/S0965542510060011","journal-title":"Comput. Math. Math. Phys."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"More, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. Argonne National Laboratory, Applied Mathematics Division, Technical Memorandum No. 324, p. 96 (1978)","DOI":"10.2172\/6650344"},{"issue":"10","key":"1_CR13","doi-asserted-by":"publisher","first-page":"6166","DOI":"10.1063\/1.453492","volume":"87","author":"JA Northby","year":"1987","unstructured":"Northby, J.A.: Structure and binding of Lennard-Jones clusters: $$13\\le N\\le 147$$. J. Chem. Phys. 87(10), 6166\u20136177 (1987)","journal-title":"J. Chem. Phys."},{"issue":"10","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1134\/S0965542506100022","volume":"46","author":"IV Oseledets","year":"2006","unstructured":"Oseledets, I.V., Savostyanov, D.V.: Minimization methods for approximating tensors and their comparison. Comput. Math. Math. Phys. 46(10), 1641\u20131650 (2006). https:\/\/doi.org\/10.1134\/S0965542506100022","journal-title":"Comput. Math. Math. Phys."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"3272","DOI":"10.1016\/j.laa.2010.01.023","volume":"432","author":"VY Pan","year":"2010","unstructured":"Pan, V.Y., Qian, G.: Randomized preprocessing of homogeneous linear systems of equations. Linear Algebra Appl. 432, 3272\u20133318 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"B1","DOI":"10.1137\/110855934","volume":"35","author":"HD Sterck","year":"2013","unstructured":"Sterck, H.D., Miller, K.: An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition. SIAM J. Sci. Comput. 35(1), B1\u2013B24 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"143","key":"1_CR17","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1090\/S0025-5718-1978-0483452-7","volume":"32","author":"PL Toint","year":"1978","unstructured":"Toint, P.L.: Some numerical results using a sparse matrix updating formula in unconstrained optimization. Math. Comput. 32(143), 839\u2013851 (1978)","journal-title":"Math. Comput."},{"issue":"28","key":"1_CR18","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1021\/jp970984n","volume":"101","author":"DJ Wales","year":"1997","unstructured":"Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J. Phys. Chem. A 101(28), 5111\u20135116 (1997)","journal-title":"J. Phys. Chem. A"},{"issue":"8","key":"1_CR19","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/LSP.2010.2052243","volume":"17","author":"L Yu","year":"2010","unstructured":"Yu, L., Barbot, J.P., Zheng, G., Sun, H.: Compressive sensing with chaotic sequence. IEEE Sig. Process. Lett. 17(8), 731\u2013734 (2010)","journal-title":"IEEE Sig. Process. Lett."}],"container-title":["Communications in Computer and Information Science","Advances in Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22990-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:21:16Z","timestamp":1672539676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22990-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229893","9783031229909"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22990-9_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}