A split Levenberg-Marquardt method for large-scale sparse problems
Nataša Krejić (),
Greta Malaspina () and
Lense Swaenen ()
Additional contact information
Nataša Krejić: University of Novi Sad
Greta Malaspina: University of Novi Sad
Lense Swaenen: Mathware department, Sioux Technologies
Computational Optimization and Applications, 2023, vol. 85, issue 1, No 5, 147-179
Abstract:
Abstract We consider large-scale nonlinear least squares problems with sparse residuals, each of them depending on a small number of variables. A decoupling procedure which results in a splitting of the original problems into a sequence of independent problems of smaller sizes is proposed and analysed. The smaller size problems are modified in a way that offsets the error made by disregarding dependencies that allow us to split the original problem. The resulting method is a modification of the Levenberg-Marquardt method with smaller computational costs. Global convergence is proved as well as local linear convergence under suitable assumptions on sparsity. The method is tested on the network localization simulated problems with up to one million variables and its efficiency is demonstrated.
Keywords: Least squares problems; Levenberg Marquardt method; Splitting; Local linear convergence; Global convergence (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10589-023-00460-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00460-9
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-023-00460-9
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().