SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:uu-478299"
 

Search: onr:"swepub:oai:DiVA.org:uu-478299" > Cluster Gauss-Newto...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Cluster Gauss-Newton method : An algorithm for finding multiple approximate minimisers of nonlinear least squares problems with applications to parameter estimation of pharmacokinetic models

Aoki, Yasunori, 1982- (author)
Uppsala universitet,Institutionen för farmaceutisk biovetenskap,Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan.;RIKEN, Sugiyama Lab, Baton Zone Program, Tsurumi Ku, 1-7-22 Suehiro Cho, Yokohama, Kanagawa 2300045, Japan
Hayami, Ken (author)
Grad Univ Adv Studies SOKENDAI, Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan
Toshimoto, Kota (author)
RIKEN, Sugiyama Lab, Baton Zone Program, Tsurumi Ku, 1-7-22 Suehiro Cho, Yokohama, Kanagawa 2300045, Japan
show more...
Sugiyama, Yuichi (author)
RIKEN, Sugiyama Lab, Baton Zone Program, Tsurumi Ku, 1-7-22 Suehiro Cho, Yokohama, Kanagawa 2300045, Japan
show less...
 (creator_code:org_t)
2020-10-28
2022
English.
In: Optimization and Engineering. - : Springer. - 1389-4420 .- 1573-2924. ; 23:1, s. 169-199
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • Parameter estimation problems of mathematical models can often be formulated as nonlinear least squares problems. Typically these problems are solved numerically using iterative methods. The local minimiser obtained using these iterative methods usually depends on the choice of the initial iterate. Thus, the estimated parameter and subsequent analyses using it depend on the choice of the initial iterate. One way to reduce the analysis bias due to the choice of the initial iterate is to repeat the algorithm from multiple initial iterates (i.e. use a multi-start method). However, the procedure can be computationally intensive and is not always used in practice. To overcome this problem, we propose the Cluster Gauss-Newton (CGN) method, an efficient algorithm for finding multiple approximate minimisers of nonlinear-least squares problems. CGN simultaneously solves the nonlinear least squares problem from multiple initial iterates. Then, CGN iteratively improves the approximations from these initial iterates similarly to the Gauss-Newton method. However, it uses a global linear approximation instead of the Jacobian. The global linear approximations are computed collectively among all the iterates to minimise the computational cost associated with the evaluation of the mathematical model. We use physiologically based pharmacokinetic (PBPK) models used in pharmaceutical drug development to demonstrate its use and show that CGN is computationally more efficient and more robust against local minima compared to the standard Levenberg-Marquardt method, as well as state-of-the art multi-start and derivative-free methods.

Subject headings

NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)

Keyword

Nonlinear least squares problem
Multi-start method
Cluster Newton method
Derivative-free method
Physiologically based pharmacokinetic (PBPK) model
Parameter estimation

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Aoki, Yasunori, ...
Hayami, Ken
Toshimoto, Kota
Sugiyama, Yuichi
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
and Computational Ma ...
Articles in the publication
Optimization and ...
By the university
Uppsala University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view