Boomer Manual and Download
PharmPK Listserv and other PK Resources
Previous Page Course Index Next Page

Steepest Descent Method

The steepest descent method use the slope at the initial point and moves down hill.

Equation for steepest slope

Equation 11.4.1 New parameter value Calculated from WSS Surface

The computer program can estimate the rate of change of WSS with respect to each parameters (δWSS/δP) by making a small change in each parameter and determining the new WSS. This gives a direction. A linear search in this direction provides the value of h for the lowest WSS. This point becomes the old value and a new search is undertaken. With each iteration the program moves closer to the minimum value of the WSS.

Plot of V and kel

Figure 11.4.1 Contour map of kel versus V showing probable Path of Steepest Descent Method

Advantages of this method

Disadvantages of this method

The steepest descent method is not commonly used on its own to perform a nonlinear least squares best-fit but it does form the basis of another more useful method, Marquardt's method. The linear search, zigzaging down valleys and being so slow near the minimum mean that other methods are more efficient.

return to the Course index

This page was last modified: Tuesday, 24th Oct 2017 at 5:56 pm

Privacy Statement - 25 May 2018

Material on this website should be used for Educational or Self-Study Purposes Only

iBook and pdf versions of this material and other PK material is available

Copyright © 2001-2018 David W. A. Bourne (