A split Levenberg-Marquardt method for large-scale sparse problems

DOI10.1007/s10589-023-00460-9OpenAlexW4320896459MaRDI QIDQ2701422

Lense Swaenen, Greta Malaspina, Nataša Krejić

Publication date: 28 April 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.05188

zbMATH Keywords

global convergencesplittingleast squares problemslocal linear convergenceLevenberg Marquardt method

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• GitHub

Cites Work

• Wireless sensor network localization techniques
• A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
• Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method
• Convergence properties of a self-adaptive Levenberg-Marquardt algorithm under local error bound condition
• Newton-like method with modification of the right-hand-side vector
• Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
• Newton-like Method with Diagonal Correction for Distributed Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A split Levenberg-Marquardt method for large-scale sparse problems