Cluster Gauss-Newton method. An algorithm for finding multiple approximate minimisers of nonlinear least squares problems with applications to parameter estimation of pharmacokinetic models
From MaRDI portal
Publication:2138298
DOI10.1007/s11081-020-09571-2zbMath1492.90168arXiv1808.06714OpenAlexW3094962213MaRDI QIDQ2138298
Kota Toshimoto, Yuichi Sugiyama, Yasunori Aoki, Ken Hayami
Publication date: 11 May 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.06714
parameter estimationderivative-free methodnonlinear least squares problemcluster Newton methodmulti-start methodphysiologically based pharmacokinetic (PBPK) model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lipschitzian optimization without the Lipschitz constant
- A comparative study on methods for convergence acceleration of iterative vector sequences
- A derivative-free Gauss-Newton method
- ggplot2
- A stochastic method for global optimization
- The MATLAB ODE Suite
- Implicit Filtering
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Trust Region Methods
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers
- Derivative-free optimization methods
- Cluster Newton Method for Sampling Multiple Solutions of Underdetermined Inverse Problems: Application to a Parameter Identification Problem in Pharmacokinetics
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- Optimal Conditioning of Quasi-Newton Methods
- A radial basis function method for global optimization
This page was built for publication: Cluster Gauss-Newton method. An algorithm for finding multiple approximate minimisers of nonlinear least squares problems with applications to parameter estimation of pharmacokinetic models