2011
DOI: 10.1016/j.cageo.2010.11.005
|View full text |Cite
|
Sign up to set email alerts
|

A truncated Levenberg–Marquardt algorithm for the calibration of highly parameterized nonlinear models

Abstract: We propose a modification to the Levenberg-Marquardt minimization algorithm for a more robust and more efficient calibration of highly parameterized, strongly nonlinear models of multiphase flow through porous media. The new method combines the advantages of truncated singular value decomposition with those of the classical Levenberg-Marquardt algorithm, thus enabling a more robust solution of underdetermined inverse problems with complex relations between the parameters to be estimated and the observable stat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 33 publications
(22 citation statements)
references
References 29 publications
(32 reference statements)
0
22
0
Order By: Relevance
“…The classical Levenberg-Marquardt algorithm has been widely used in inverse modeling, because it is more robust than the Gauss-Newton method and yields a faster rate of convergence than the steepest descent method [Finsterle and Kowalsky, 2011;Fienen et al, 2009;Nowak and Cirpka, 2004;Simunek et al, 1998]. However, the efficiency and robustness of Levenberg-Marquardt algorithm is dependent on the correct selection of the damping parameter [Nielsen, 1999].…”
Section: Classical Levenberg-marquardt Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The classical Levenberg-Marquardt algorithm has been widely used in inverse modeling, because it is more robust than the Gauss-Newton method and yields a faster rate of convergence than the steepest descent method [Finsterle and Kowalsky, 2011;Fienen et al, 2009;Nowak and Cirpka, 2004;Simunek et al, 1998]. However, the efficiency and robustness of Levenberg-Marquardt algorithm is dependent on the correct selection of the damping parameter [Nielsen, 1999].…”
Section: Classical Levenberg-marquardt Methodsmentioning
confidence: 99%
“…In this version, a parallel run manager, YAMR (Yet Another run ManageR), has been integrated. Another example of the coarse-grained parallelism is the ''Parallel PEST'' option used in the software packages of PEST [Doherty and Hunt, 2010].The Levenberg-Marquardt (LM) algorithm has been used extensively in solving nonlinear inverse problems in groundwater modeling because of its robustness [Finsterle and Kowalsky, 2011;Tonkin and Doherty, 2005;Nowak and Cirpka, 2004;Cooley, 1985]. In this work, we also use it to solve our minimization problem.…”
mentioning
confidence: 99%
“…Main methods for gradient-based optimization are the Levenberg-Marquardt formulation and the conjugate gradient or quasi-Newton approaches. For the Levenberg-Marquardt formulation, studies and algorithm development are included by Zhang et al [2003], Tonkin and Doherty [2005], Finsterle and Kowalsky [2011], and Finsterle and Zhang [2011]. For the conjugate gradient or quasi-Newton approach, Cheng et al [2003] and Oyerinde et al [2009] are examples.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The concept of estimating superparameters (Tonkin 290 and Doherty, 2005), implemented in PEST, is a powerful method to address highly 291 parameterized inverse problems. The regularization approach employed by iTOUGH2 is 292 described in Finsterle and Kowalsky (2011). In addition to the algorithm, iTOUGH2 provides the local and global minimization methods summarized in 294 Table 1.…”
Section: Relation Between Itough2 and Pest 279mentioning
confidence: 99%