Improvements to the Levenberg-Marquardt algorithm for nonlinear least-squares minimization

Abstract

When minimizing a nonlinear least-squares function, the Levenberg-Marquardt algorithm can suffer from a slow convergence, particularly when it must navigate a narrow canyon en route to a best fit. On the other hand, when the least-squares function is very flat, the algorithm may easily become lost in parameter space. We introduce several improvements to the Levenberg-Marquardt algorithm in order to improve both its convergence speed and robustness to initial parameter guesses. We update the usual step to include a geodesic acceleration correction term, explore a systematic way of accepting uphill steps that may increase the residual sum of squares due to Umrigar and Nightingale, and employ the Broyden method to update the Jacobian matrix. We test these changes by comparing their performance on a number of test problems with standard implementations of the algorithm. We suggest that these two particular challenges, slow convergence and robustness to initial guesses, are complimentary problems. Schemes that improve convergence speed often make the algorithm less robust to the initial guess, and vice versa. We provide an open source implementation of our improvements that allow the user to adjust the algorithm parameters to suit particular needs.

32 pages, 16 figures

Cited by in corpus (11)

• KLIFF: A framework to develop physics-based and machine learning interatomic potentials
• Bayesian, frequentist, and information geometric approaches to parametric uncertainty quantification of classical empirical interatomic potentials
• AstroPhot: Fitting Everything Everywhere All at Once in Astronomical Images
• SymForce: Symbolic Computation and Code Generation for Robotics
• A KIM-compliant potfit for fitting sloppy interatomic potentials: Application to the EDIP model for silicon
• Mixed linear-nonlinear least squares regression
• A Fourier method for the determination of focus for telescopes with stars
• Maximum Entropy Reconstruction for Discrete Distributions with Unbounded Support
• Extending OpenKIM with an Uncertainty Quantification Toolkit for Molecular Modeling
• A Python Code to Determine Orbital Parameters of Spectroscopic Binaries
• On the maximization of likelihoods belonging to the exponential family using ideas related to the Levenberg-Marquardt approach