메뉴 건너뛰기




Volumn 18, Issue 6, 2010, Pages 1019-1030

Design of optimal sampling times for pharmacokinetic trials via spline approximation

Author keywords

Optimal sampling time design; Pharmacokinetic parameters; Sequential quadratic programming; Spline approximation

Indexed keywords

ACCURATE ESTIMATION; CRITERION FUNCTIONS; CUBIC SPLINE; DRUG ABSORPTION; DRUG DELIVERY FORMULATIONS; GLOBAL OPTIMALITY; NUMBER OF SAMPLES; OPTIMAL SAMPLING; OVER SAMPLING; PHARMACOKINETIC PARAMETERS; PHARMACOKINETIC STUDIES; PIECEWISE LINEAR APPROXIMATIONS; SAMPLE COLLECTION; SEQUENTIAL QUADRATIC PROGRAMMING; SPLINE APPROXIMATION; SPLINE APPROXIMATIONS;

EID: 78649384190     PISSN: 13000632     EISSN: 13036203     Source Type: Journal    
DOI: 10.3906/elk-0911-308     Document Type: Article
Times cited : (5)

References (18)
  • 3
    • 0031713864 scopus 로고    scopus 로고
    • Optimal selection procedures for abbreviated area under curve(AAUC) of blood concentration versus time for drug blood concentration levels
    • Chang DT, Wong RL. "Optimal selection procedures for Abbreviated Area Under Curve(AAUC) of blood concentration versus time for drug blood concentration levels," J. OfBiopharm.Stat., 8, 407-416, 1998.
    • (1998) J. OfBiopharm.Stat. , vol.8 , pp. 407-416
    • Chang, D.T.1    Wong, R.L.2
  • 4
    • 0033999652 scopus 로고    scopus 로고
    • Optimal sampling times in bioequivalence tests
    • Kong FH, Gonin R. "Optimal sampling times in bioequivalence tests," J. of Biopharm.Stat., 10, 31-44, 2000.
    • (2000) J. of Biopharm.Stat. , vol.10 , pp. 31-44
    • Kong, F.H.1    Gonin, R.2
  • 5
    • 0027201526 scopus 로고
    • Optimum experimental designs forproperties of compartmental model
    • Atkinson AC, Chaloner K, Herzberg AM, and Juritz J. Optimum experimental designs forproperties of compartmental model. Biometrics 49:325-337 (1993).
    • (1993) Biometrics , vol.49 , pp. 325-337
    • Atkinson, A.C.1    Chaloner, K.2    Herzberg, A.M.3    Juritz, J.4
  • 6
    • 0019843944 scopus 로고
    • Optimal sampling times for pharmacokinetic experiments
    • D'Argenio DZ. "Optimal sampling times for pharmacokinetic experiments. J. Pharmacokin. Biopharm. 9:739-756 (1981).
    • (1981) J. Pharmacokin. Biopharm , vol.9 , pp. 739-756
    • D'Argenio, D.Z.1
  • 7
    • 0031412765 scopus 로고    scopus 로고
    • Comparison of ED, EID and API criteria for the robustoptimization of sampling times in pharmacokinetics
    • M. Tod and J. M. Rocchisani. Comparison of ED, EID and API criteria for the robustoptimization of sampling times in pharmacokinetics.J. Pharmacokin. Biopharm. 25:515-537(1997).
    • (1997) J. Pharmacokin. Biopharm. , vol.25 , pp. 515-537
    • Tod, M.1    Rocchisani, J.M.2
  • 8
    • 0017884783 scopus 로고
    • A comparison of numerical integrating algorithms by trapezoidal, Lagrange, and spline approximations
    • K. C. Yeh and K. C. Kwan.A comparison of numerical integrating algorithms by trapezoidal, Lagrange, and spline approximations.J. Pharmacokin. Biopharm. 6:79-98, 1978.
    • (1978) J. Pharmacokin. Biopharm. , vol.6 , pp. 79-98
    • Yeh, K.C.1    Kwan, K.C.2
  • 9
    • 0003363041 scopus 로고
    • A practical guide to splines
    • Springer Verlag, New York
    • C. de Boor. A Practical Guide to Splines.Applied Math.Sciences Vol. 27. Springer Verlag, New York, 1978.
    • (1978) Applied Math.Sciences , vol.27
    • De Boor, C.1
  • 13
    • 0000387235 scopus 로고
    • A rapidly convergent descent method for minimization
    • R. Fletcher and M. J. D. Powell.A rapidly convergent descent method for minimization.Computer Journal 6:163-168 (1963).
    • (1963) Computer Journal , vol.6 , pp. 163-168
    • Fletcher, R.1    Powell, M.J.D.2
  • 14
    • 84966251980 scopus 로고
    • A family of variable metric updates derived by variational means
    • D. Goldfarb. A family of variable metric updates derived by variational means.Mathematicsof Computing 24:23-26 (1970).
    • (1970) Mathematicsof Computing , vol.24 , pp. 23-26
    • Goldfarb, D.1
  • 15
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • J. A. Nelder and R. Mead.A simplex method for function minimization.The ComputerJournal 7: 308-313 (1965).
    • (1965) The Computer Journal , vol.7 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 16
    • 0028538493 scopus 로고
    • Adaptive partitioned random search to global optimization
    • Z. B. Tang. Adaptive partitioned random search to global optimization. IEEE Transactionson Automatic Control 39: 2235-2244 (1994).
    • (1994) IEEE Transactionson Automatic Control , vol.39 , pp. 2235-2244
    • Tang, Z.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.