This algorithm provides a numerical solution to the problem of minimizing a function. This is more efficient than the Gauss-Newton-like algorithm when starting from points very far from the final minimum. 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 (GH-1G).
| Version: | 1.1 |
| Depends: | R (≥ 2.0.0) |
| Published: | 2013-03-18 |
| Author: | D. Commenges, M. Prague and A. Diakite |
| Maintainer: | Melanie Prague <Melanie.Prague at isped.u-bordeaux2.fr> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2.0)] |
| URL: | http://www.r-project.org |
| NeedsCompilation: | yes |
| CRAN checks: | marqLevAlg results |
| Reference manual: | marqLevAlg.pdf |
| Package source: | marqLevAlg_1.1.tar.gz |
| Windows binaries: | r-devel: marqLevAlg_1.1.zip, r-release: marqLevAlg_1.1.zip, r-oldrel: marqLevAlg_1.1.zip |
| OS X El Capitan binaries: | r-release: marqLevAlg_1.1.tgz |
| OS X Mavericks binaries: | r-oldrel: marqLevAlg_1.1.tgz |
| Old sources: | marqLevAlg archive |
Please use the canonical form https://CRAN.R-project.org/package=marqLevAlg to link to this page.