The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Algorithms for solving a self-calibrated l1-regularized quadratic programming problem without parameter tuning. The algorithm, called DECODE, can handle high-dimensional data without cross-validation. It is found useful in high dimensional portfolio selection (see Pun (2018) <https://ssrn.com/abstract=3179569>) and large precision matrix estimation and sparse linear discriminant analysis (see Pun and Hadimaja (2019) <https://ssrn.com/abstract=3422590>).
Version: | 0.1.0 |
Depends: | R (≥ 2.10) |
Imports: | stats |
Published: | 2019-12-18 |
DOI: | 10.32614/CRAN.package.rDecode |
Author: | Chi Seng Pun, Matthew Zakharia Hadimaja |
Maintainer: | Chi Seng Pun <cspun at ntu.edu.sg> |
License: | GPL-2 |
NeedsCompilation: | no |
CRAN checks: | rDecode results |
Reference manual: | rDecode.pdf |
Package source: | rDecode_0.1.0.tar.gz |
Windows binaries: | r-devel: rDecode_0.1.0.zip, r-release: rDecode_0.1.0.zip, r-oldrel: rDecode_0.1.0.zip |
macOS binaries: | r-release (arm64): rDecode_0.1.0.tgz, r-oldrel (arm64): rDecode_0.1.0.tgz, r-release (x86_64): rDecode_0.1.0.tgz, r-oldrel (x86_64): rDecode_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=rDecode to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.