Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems
Embargo End Date2021-05-12
Permanent link to this recordhttp://hdl.handle.net/10754/662924
MetadataShow full item record
AbstractThe 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.
CitationBergou, E. H., Diouane, Y., & Kungurtsev, V. (2020). Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems. Journal of Optimization Theory and Applications. doi:10.1007/s10957-020-01666-1
SponsorsWe would like to thank Clément Royer and the referees for their careful readings and corrections that helped us to improve our manuscript significantly. Support for Vyacheslav Kungurtsev was provided by the OP VVV Project CZ.02.1.01/0.0/0.0/16_019/0000765 “Research Center for Informatics”.
PublisherSpringer Science and Business Media LLC