Modified Levenberg Marquardt algorithm for inverse problems

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Levenberg Marquardt (LM) algorithm is a popular non-linear least squares optimization technique for solving data matching problems. In this method, the damping parameter plays a vital role in determining the convergence of the system. This damping parameter is calculated arbitrarily in the classical LM, causing it to converge prematurely when used for solving real world engineering problems. This paper focuses on changes made to the classical LM algorithm to enhance its performance. This is achieved by adaptive damping, wherein the damping parameter is varied depending on the convergence of the objective function. To eliminate the need for a good initial guess, the idea of using an evolutionary algorithm in conjunction with the LM algorithm is also explored. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Naveen, M., Jayaraman, S., Ramanath, V., & Chaudhuri, S. (2010). Modified Levenberg Marquardt algorithm for inverse problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6457 LNCS, pp. 623–632). https://doi.org/10.1007/978-3-642-17298-4_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free