Nothing
This algorithm provides a numerical solution to the problem of minimizing (or maximizing) a function. This is more efficient than the GaussNewtonlike algorithm when starting from points very far from the final minimum (or maximum). A new convergence test is implemented (RDM) in addition to the usual stopping criterion : stopping rule is when the gradients are small enough in the parameters metric (GH1G).
Package details 


Author  Melanie Prague, Viviane Philipps, Cecile ProustLima, Boris Hejblum, Daniel Commenges, Amadou Diakite 
Maintainer  Viviane Philipps <[email protected]> 
License  GPL (>= 2.0) 
Version  2.0.1 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.