Statistical identifiability and convergence evaluation for nonlinear pharmacokinetic models with particle swarm optimization

Seongho Kim, Lang Li

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The statistical identifiability of nonlinear pharmacokinetic (PK) models with the Michaelis-Menten (MM) kinetic equation is considered using a global optimization approach, which is particle swarm optimization (PSO). If a model is statistically non-identifiable, the conventional derivative-based estimation approach is often terminated earlier without converging, due to the singularity. To circumvent this difficulty, we develop a derivative-free global optimization algorithm by combining PSO with a derivative-free local optimization algorithm to improve the rate of convergence of PSO. We further propose an efficient approach to not only checking the convergence of estimation but also detecting the identifiability of nonlinear PK models. PK simulation studies demonstrate that the convergence and identifiability of the PK model can be detected efficiently through the proposed approach. The proposed approach is then applied to clinical PK data along with a two-compartmental model.

Original languageEnglish
Pages (from-to)413-432
Number of pages20
JournalComputer Methods and Programs in Biomedicine
Volume113
Issue number2
DOIs
StatePublished - Feb 2014

Fingerprint

Nonlinear Dynamics
Pharmacokinetics
Particle swarm optimization (PSO)
Global optimization
Derivatives
Kinetics

Keywords

  • Michaelis-Menten kinetic equation
  • Nonlinear models
  • Particle swarm optimization
  • Pharmacokinetics
  • Statistical identifiability

ASJC Scopus subject areas

  • Computer Science Applications
  • Software
  • Health Informatics

Cite this

Statistical identifiability and convergence evaluation for nonlinear pharmacokinetic models with particle swarm optimization. / Kim, Seongho; Li, Lang.

In: Computer Methods and Programs in Biomedicine, Vol. 113, No. 2, 02.2014, p. 413-432.

Research output: Contribution to journalArticle

@article{5ee01f971a7c416a8fb0cf0f43de2413,
title = "Statistical identifiability and convergence evaluation for nonlinear pharmacokinetic models with particle swarm optimization",
abstract = "The statistical identifiability of nonlinear pharmacokinetic (PK) models with the Michaelis-Menten (MM) kinetic equation is considered using a global optimization approach, which is particle swarm optimization (PSO). If a model is statistically non-identifiable, the conventional derivative-based estimation approach is often terminated earlier without converging, due to the singularity. To circumvent this difficulty, we develop a derivative-free global optimization algorithm by combining PSO with a derivative-free local optimization algorithm to improve the rate of convergence of PSO. We further propose an efficient approach to not only checking the convergence of estimation but also detecting the identifiability of nonlinear PK models. PK simulation studies demonstrate that the convergence and identifiability of the PK model can be detected efficiently through the proposed approach. The proposed approach is then applied to clinical PK data along with a two-compartmental model.",
keywords = "Michaelis-Menten kinetic equation, Nonlinear models, Particle swarm optimization, Pharmacokinetics, Statistical identifiability",
author = "Seongho Kim and Lang Li",
year = "2014",
month = "2",
doi = "10.1016/j.cmpb.2013.10.003",
language = "English",
volume = "113",
pages = "413--432",
journal = "Computer Methods and Programs in Biomedicine",
issn = "0169-2607",
publisher = "Elsevier Ireland Ltd",
number = "2",

}

TY - JOUR

T1 - Statistical identifiability and convergence evaluation for nonlinear pharmacokinetic models with particle swarm optimization

AU - Kim, Seongho

AU - Li, Lang

PY - 2014/2

Y1 - 2014/2

N2 - The statistical identifiability of nonlinear pharmacokinetic (PK) models with the Michaelis-Menten (MM) kinetic equation is considered using a global optimization approach, which is particle swarm optimization (PSO). If a model is statistically non-identifiable, the conventional derivative-based estimation approach is often terminated earlier without converging, due to the singularity. To circumvent this difficulty, we develop a derivative-free global optimization algorithm by combining PSO with a derivative-free local optimization algorithm to improve the rate of convergence of PSO. We further propose an efficient approach to not only checking the convergence of estimation but also detecting the identifiability of nonlinear PK models. PK simulation studies demonstrate that the convergence and identifiability of the PK model can be detected efficiently through the proposed approach. The proposed approach is then applied to clinical PK data along with a two-compartmental model.

AB - The statistical identifiability of nonlinear pharmacokinetic (PK) models with the Michaelis-Menten (MM) kinetic equation is considered using a global optimization approach, which is particle swarm optimization (PSO). If a model is statistically non-identifiable, the conventional derivative-based estimation approach is often terminated earlier without converging, due to the singularity. To circumvent this difficulty, we develop a derivative-free global optimization algorithm by combining PSO with a derivative-free local optimization algorithm to improve the rate of convergence of PSO. We further propose an efficient approach to not only checking the convergence of estimation but also detecting the identifiability of nonlinear PK models. PK simulation studies demonstrate that the convergence and identifiability of the PK model can be detected efficiently through the proposed approach. The proposed approach is then applied to clinical PK data along with a two-compartmental model.

KW - Michaelis-Menten kinetic equation

KW - Nonlinear models

KW - Particle swarm optimization

KW - Pharmacokinetics

KW - Statistical identifiability

UR - http://www.scopus.com/inward/record.url?scp=84892798928&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892798928&partnerID=8YFLogxK

U2 - 10.1016/j.cmpb.2013.10.003

DO - 10.1016/j.cmpb.2013.10.003

M3 - Article

VL - 113

SP - 413

EP - 432

JO - Computer Methods and Programs in Biomedicine

JF - Computer Methods and Programs in Biomedicine

SN - 0169-2607

IS - 2

ER -