{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:58:30Z","timestamp":1776085110746,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100016047","name":"Science Fund of the Republic of Serbia","doi-asserted-by":"publisher","award":["7359"],"award-info":[{"award-number":["7359"]}],"id":[{"id":"10.13039\/501100016047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Motivated by localization problems such as cadastral maps refinements, we consider a generic Nonlinear Least Squares (NLS) problem of minimizing an aggregate squared fit across all nonlinear equations (measurements) with respect to the set of unknowns, e.g., coordinates of the unknown points\u2019 locations. In a number of scenarios, NLS problems exhibit a nearly-separable structure: the set of measurements can be partitioned into disjoint groups (blocks), such that the unknowns that correspond to different blocks are only loosely coupled. We propose an efficient parallel method, termed Parallel Inexact Levenberg\u2013Marquardt (PILM), to solve such generic large scale NLS problems. PILM builds upon the classical Levenberg\u2013Marquard (LM) method, with a main novelty in that the nearly-block separable structure is leveraged in order to obtain a scalable parallel method. Therein, the problem-wide system of linear equations that needs to be solved at every LM iteration is tackled iteratively. At each (inner) iteration, the block-wise systems of linear equations are solved in parallel, while the problem-wide system is then handled via sparse, inexpensive inter-block communication. We establish strong convergence guarantees of PILM that are analogous to those of the classical LM; provide PILM implementation in a master-worker parallel computational environment; and demonstrate its efficiency on huge scale cadastral map refinement problems.<\/jats:p>","DOI":"10.1007\/s10898-025-01494-5","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T08:47:00Z","timestamp":1746694020000},"page":"663-691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel inexact Levenberg\u2013Marquardt method for nearly-separable nonlinear least squares"],"prefix":"10.1007","volume":"92","author":[{"given":"Lidija","family":"Fodor","sequence":"first","affiliation":[]},{"given":"Du\u0161an","family":"Jakoveti\u0107","sequence":"additional","affiliation":[]},{"given":"Nata\u0161a","family":"Kreji\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2749-148X","authenticated-orcid":false,"given":"Greta","family":"Malaspina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"key":"1494_CR1","first-page":"1","volume":"74","author":"SP Ahmadi","year":"2021","unstructured":"Ahmadi, S.P., Hansson, A., Pakazad, S.K.: Distributed localization using Levenberg-Marquardt algorithm. EURASIP J. Adv. Signal Process. 74, 1\u201326 (2021)","journal-title":"EURASIP J. Adv. Signal Process."},{"issue":"5","key":"1494_CR2","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/TSP.2007.909342","volume":"56","author":"A Beck","year":"2008","unstructured":"Beck, A., Stoica, P., Li, J.: Exact and approximate solutions of source localization problems. IEEE Trans. Signal Process. 56(5), 1770\u20131778 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"1494_CR3","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s10957-019-01586-9","volume":"183","author":"R Behling","year":"2019","unstructured":"Behling, R., Gon\u00e7alves, D.S., Santos, S.A.: Local convergence analysis of the Levenberg\u2013Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition. J. Optim. Theory Appl. 183, 1099\u20131122 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1494_CR4","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\u2013Marquardt 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."},{"key":"1494_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10898-020-00970-4","volume":"80","author":"EV Castelani","year":"2021","unstructured":"Castelani, E.V., Lopes, R., Shirabayashi, W.V.I., Sobral, F.N.C.: A robust method based on LOVO functions for solving least squares problems. J. Global Optim. 80, 387\u2013414 (2021)","journal-title":"J. Global Optim."},{"issue":"4","key":"1494_CR6","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/1055678021000049345","volume":"17","author":"H Dan","year":"2002","unstructured":"Dan, H., Yamashita, N., Fukushima, M.: Convergence properties of the inexact Levenberg\u2013Marquardt method under local error bound conditions. Optim. Methods Softw. 17(4), 605\u2013626 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1494_CR7","first-page":"247","volume":"1","author":"T Erseghe","year":"2015","unstructured":"Erseghe, T.: A distributed and maximum-likelihood sensor network localization algorithm based upon a nonconvex problem formulation. IEEE Trans. Signal Inform. Process. over Netw. 1(4), 247\u2013258 (2015)","journal-title":"IEEE Trans. Signal Inform. Process. over Netw."},{"issue":"1","key":"1494_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-005-3074-z","volume":"34","author":"J Fan","year":"2006","unstructured":"Fan, J., Pan, J.: Convergence properties of a self-adaptive Levenberg\u2013Marquardt algorithm under local error bound condition. Comput. Optim. Appl. 34(1), 47\u201362 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1494_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00607-004-0083-1","volume":"74","author":"J Fan","year":"2005","unstructured":"Fan, J., Yuan, Y.: On the quadratic convergence of the Levenberg\u2013Marquardt method without nonsingularity assumption. Computing 74(1), 23\u201339 (2005)","journal-title":"Computing"},{"key":"1494_CR10","unstructured":"Franken, J., Florijn, W., Hoekstra, M., Hagemans, E.: Rebuilding the cadastral map of the Netherlands: the artificial intelligence solution. FIG working week 2021 proceedings, (2021)"},{"key":"1494_CR11","unstructured":"Haas, A.: Pypardiso. https:\/\/github.com\/haasad\/PyPardisoProject"},{"key":"1494_CR12","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10589-016-9845-x","volume":"65","author":"EW Karas","year":"2016","unstructured":"Karas, E.W., Santos, S.A., Svaiter, B.F.: Algebraic rules for computing the regularization parameter of the Levenberg\u2013Marquardt method. Comput. Optim. Appl. 65, 723\u2013751 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1494_CR13","unstructured":"Karypis, G., Kumar, V.: Graph Partitioning and Sparse Matrix Ordering System. University of Minnesota, (2009)"},{"key":"1494_CR14","doi-asserted-by":"crossref","unstructured":"Konolige, K.: Sparse bundle adjustment. British Machine Vision Conference, (2010)","DOI":"10.5244\/C.24.102"},{"issue":"1","key":"1494_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10589-023-00460-9","volume":"85","author":"N Krejic","year":"2023","unstructured":"Krejic, N., Swaenen, L., Malaspina, G.: A split Levenberg-Marquardt method for large-scale sparse problems. Comput. Optim. Appl. 85(1), 147\u2013179 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"10","key":"1494_CR16","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1016\/j.comnet.2006.11.018","volume":"51","author":"G Mao","year":"2007","unstructured":"Mao, G., Fidan, B., Anderson, B.D.O.: Wireless sensor network localization techniques. Comput. Netw. 51(10), 2529\u20132553 (2007)","journal-title":"Comput. Netw."},{"key":"1494_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10898-006-9071-7","volume":"38","author":"KM Mullen","year":"2007","unstructured":"Mullen, K.M., Vengris, M.V., van Stokkum, I.H.M.: Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra. J. Global Optim. 38, 201\u2013213 (2007)","journal-title":"J. Global Optim."},{"issue":"3","key":"1494_CR18","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/JOE.2016.2578218","volume":"42","author":"BC Pinheiro","year":"2017","unstructured":"Pinheiro, B.C., Moreno, U.F., de Sousa, J.T.B., Rodr\u00edguez, O.C.: Kernel-function-based models for acoustic localization of underwater vehicles. IEEE J. Oceanic Eng. 42(3), 603\u2013618 (2017)","journal-title":"IEEE J. Oceanic Eng."},{"key":"1494_CR19","doi-asserted-by":"crossref","unstructured":"Rabbat, M., Nedic, A.: onvergence properties of normalized random incremental gradient algorithms for least-squares source localization. Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), (2012)","DOI":"10.1109\/ACSSC.2012.6489259"},{"key":"1494_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TSP.2015.2454853","volume":"63","author":"C Soares","year":"2015","unstructured":"Soares, C., Xavier, J., Gomes, J.: Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements. IEEE Trans. Signal Process. 63, 17 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"1494_CR21","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1109\/LSP.2020.2988178","volume":"27","author":"Claudia Soares","year":"2020","unstructured":"Soares, Claudia, Valdeira, Filipa, Gomes, Joao: Range and bearing data fusion for precise convex network localization. IEEE Signal Process. Lett. 27, 670\u2013674 (2020)","journal-title":"IEEE Signal Process. Lett."},{"key":"1494_CR22","unstructured":"Teunissen, P.\u00a0J.\u00a0G.: Adjustment theory. Series on Mathematical Geodesy and Positioning, (2003)"},{"key":"1494_CR23","doi-asserted-by":"crossref","unstructured":"Valdeira, F., Soares, C., Gomes, J.: Parameter-free maximum likelihood localization of a network of moving agents from ranges, bearings and velocity measurements. Signal Process., 221, (2023)","DOI":"10.2139\/ssrn.4598413"},{"key":"1494_CR24","unstructured":"van\u00a0den Heuvel, F., Vestjens, G., Verkuijl, G., van\u00a0den Broek, M.: Rebuilding the cadastral map of the Netherlands: the geodetic concept. FIG working week 2021 proceedings, (2021)"},{"key":"1494_CR25","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-7091-6217-0_18","volume":"15","author":"N Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg\u2013Marquardt method. Topics Numer. Anal. 15, 239\u2013249 (2001)","journal-title":"Topics Numer. Anal."},{"key":"1494_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10898-011-9840-9","volume":"56","author":"A Zilinskas","year":"2013","unstructured":"Zilinskas, A., Zilinskas, J.: A hybrid global optimization algorithm for non-linear least squares regression. J. Global Optim. 56, 265\u2013277 (2013)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01494-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01494-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01494-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T06:49:13Z","timestamp":1751611753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01494-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1494"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01494-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"14 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}