{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:13Z","timestamp":1742913073847,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030628666"},{"type":"electronic","value":"9783030628673"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62867-3_14","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T08:05:11Z","timestamp":1604563511000},"page":"184-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonlinear Least Squares Solver for Evaluating Canonical Tensor Decomposition"],"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":[[2020,11,4]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/cem.1335","volume":"25","author":"E Acar","year":"2011","unstructured":"Acar, E., Dunlavy, D.M., Kolda, T.G.: A scalable optimization approach for fitting canonical tensor decompositions. J. Chemometr. 25(2), 67\u201386 (2011)","journal-title":"J. Chemometr."},{"issue":"1","key":"14_CR2","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."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s00211-018-0977-z","volume":"140","author":"S Bellavia","year":"2018","unstructured":"Bellavia, S., Gratton, S., Riccietti, E.: A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients. Numer. Math. 140(3), 791\u2013825 (2018)","journal-title":"Numer. Math."},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1093\/imanum\/dru021","volume":"35","author":"S Bellavia","year":"2015","unstructured":"Bellavia, S., Morini, B.: Strong local convergence properties of adaptive regularized methods for nonlinear least squares. IMA J. Numer. Anal. 35(2), 947\u2013968 (2015)","journal-title":"IMA J. Numer. Anal."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Brent, R.P.: Algorithms for matrix multiplication (No. STAN-CS-70-157). Stanford University CA Department of Computer Science (1970)","DOI":"10.21236\/AD0705509"},{"key":"14_CR6","unstructured":"Kaporin, I.E.: Esimating global convergence of inexact Newton methods via limiting stepsize along normalized direction. Rep. 9329, July 1993, Department of Mathematics, Catholic University of Nijmegen, Nijmegen, The Netherlands, 8p. (1993)"},{"key":"14_CR7","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. 15 (Computational Math. and Cybernetics) N 3, 26\u201331 (1995)"},{"issue":"1","key":"14_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":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1134\/S0965542512020091","volume":"52","author":"I Kaporin","year":"2012","unstructured":"Kaporin, I.: Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method. Comput. Math. Math. Phys. 52(2), 169\u2013193 (2012)","journal-title":"Comput. Math. Math. Phys."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kaporin, I.: Preconditioned subspace descent methods for the solution of nonlinear systems of equations. In: Jacimovic, M., et al. (eds.) Proceedings of X International Conference on Optimization and Applications (OPTIMA 2019). Communications in Computer and Information Science (CCIS). Springer Nature Switzerland AG (2019)","DOI":"10.1007\/978-3-030-38603-0_13"},{"issue":"1","key":"14_CR11","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":"14_CR12","unstructured":"Karimi, S., Vavasis, S.: Conjugate gradient with subspace optimization (2012). arXiv preprint arXiv:1202.1479v1"},{"issue":"6","key":"14_CR13","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)","journal-title":"Comput. Math. Math. Phys."},{"issue":"10","key":"14_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)","journal-title":"Comput. Math. Math. Phys."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1002\/nla.1963","volume":"22","author":"HD Sterck","year":"2015","unstructured":"Sterck, H.D., Winlaw, M.: A nonlinearly preconditioned conjugate gradient algorithm for rank-R canonical tensor approximation. Numer. Linear Algebra Appl. 22(3), 410\u2013432 (2015)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"14_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":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3934\/naco.2011.1.15","volume":"1","author":"YX Yuan","year":"2011","unstructured":"Yuan, Y.X.: Recent advances in numerical methods for nonlinear equations and nonlinear least squares. Numer. Algebra Control Optim. 1(1), 15\u201334 (2011)","journal-title":"Numer. Algebra Control Optim."},{"issue":"8","key":"14_CR18","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 Signal Process. Lett. 17(8), 731\u2013734 (2010)","journal-title":"IEEE Signal Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62867-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:01:46Z","timestamp":1619265706000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62867-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628666","9783030628673"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62867-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","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":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=optima-2020","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":"60","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":"21","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":"2","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":"35% - 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.25","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.23","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}