Skip to Main content Skip to Navigation
Journal articles

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems

Abstract : The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a competitive worst-case iteration complexity rate, and a guaranteed rate of local convergence for both zero and nonzero small residual problems, under suitable assumptions. We introduce a novel Levenberg-Marquardt method that matches, simultaneously, the state of the art in all of these convergence properties with a single seamless algorithm. Numerical experiments confirm the theoretical behavior of our proposed algorithm.
Document type :
Journal articles
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02639211
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Thursday, May 28, 2020 - 11:31:43 AM
Last modification on : Tuesday, September 13, 2022 - 2:14:30 PM

File

Bergou_26029.pdf
Files produced by the author(s)

Identifiers

Citation

El Houcine Bergou, Youssef Diouane, Vyacheslav Kungurtsev. Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems. Journal of Optimization Theory and Applications, Springer Verlag, 2020, 185 (3), pp.927-944. ⟨10.1007/s10957-020-01666-1⟩. ⟨hal-02639211⟩

Share

Metrics

Record views

20

Files downloads

841