Nothing
This algorithm provides a numerical solution to the problem of unconstrained local minimization (or maximization). It is particularly suited for complex problems and more efficient than the GaussNewtonlike algorithm when starting from points very far from the final minimum (or maximum). Each iteration is parallelized and convergence relies on a stringent stopping criterion based on the first and second derivatives. See Philipps et al, 2021 <doi:10.32614/RJ2021089>.
Package details 


Author  Viviane Philipps, Cecile ProustLima, Melanie Prague, Boris Hejblum, Daniel Commenges, Amadou Diakite 
Maintainer  Viviane Philipps <viviane.philipps@ubordeaux.fr> 
License  GPL (>= 2.0) 
Version  2.0.8 
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.