Last updated on 2024-08-16 21:49:02 CEST.
Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
---|---|---|---|---|---|---|
r-devel-linux-x86_64-debian-clang | 1.0 | 3.90 | 40.24 | 44.14 | NOTE | |
r-devel-linux-x86_64-debian-gcc | 1.0 | 3.73 | 29.51 | 33.24 | NOTE | |
r-devel-linux-x86_64-fedora-clang | 1.0 | 72.20 | NOTE | |||
r-devel-linux-x86_64-fedora-gcc | 1.0 | 68.01 | NOTE | |||
r-devel-windows-x86_64 | 1.0 | 6.00 | 55.00 | 61.00 | NOTE | |
r-patched-linux-x86_64 | 1.0 | 3.64 | 38.39 | 42.03 | NOTE | |
r-release-linux-x86_64 | 1.0 | 3.82 | 38.94 | 42.76 | NOTE | |
r-release-macos-arm64 | 1.0 | 25.00 | NOTE | |||
r-release-macos-x86_64 | 1.0 | 47.00 | NOTE | |||
r-release-windows-x86_64 | 1.0 | 6.00 | 62.00 | 68.00 | NOTE | |
r-oldrel-macos-arm64 | 1.0 | 29.00 | NOTE | |||
r-oldrel-macos-x86_64 | 1.0 | 37.00 | NOTE | |||
r-oldrel-windows-x86_64 | 1.0 | 7.00 | 65.00 | 72.00 | NOTE |
Version: 1.0
Check: Rd files
Result: NOTE
checkRd: (-1) GSparO.Rd:23: Lost braces; missing escapes or markup?
23 | Group sparse optimization (GSparO) for least squares regression by using the proximal gradient algorithm to solve the L_{2,1/2} regularization model.
| ^
checkRd: (-1) GSparO.Rd:26: Lost braces; missing escapes or markup?
26 | GSparO is group sparse optimization for least squares regression described in [Hu et al(2017)], in which the proximal gradient algorithm is implemented to solve the L_{2,1/2} regularization model. GSparO is an iterative algorithm consisting of a gradient step for the least squares regression and a proximal steps for the L_{2,1/2} penalty, which is analytically formulated in this function. Also, GSparO can solve sparse variable selection problem in absence of group structure. In particular, setting group in GSparO be a vector of ones, GSparO is reduced to the iterative half thresholding algorithm introduced in [Xu et al (2012)].
| ^
checkRd: (-1) GSparO.Rd:26: Lost braces; missing escapes or markup?
26 | GSparO is group sparse optimization for least squares regression described in [Hu et al(2017)], in which the proximal gradient algorithm is implemented to solve the L_{2,1/2} regularization model. GSparO is an iterative algorithm consisting of a gradient step for the least squares regression and a proximal steps for the L_{2,1/2} penalty, which is analytically formulated in this function. Also, GSparO can solve sparse variable selection problem in absence of group structure. In particular, setting group in GSparO be a vector of ones, GSparO is reduced to the iterative half thresholding algorithm introduced in [Xu et al (2012)].
| ^
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-devel-windows-x86_64, r-patched-linux-x86_64, r-release-linux-x86_64, r-release-macos-arm64, r-release-macos-x86_64, r-release-windows-x86_64
Version: 1.0
Check: LazyData
Result: NOTE
'LazyData' is specified without a 'data' directory
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-devel-windows-x86_64, r-patched-linux-x86_64, r-release-linux-x86_64, r-release-macos-arm64, r-release-macos-x86_64, r-release-windows-x86_64, r-oldrel-macos-arm64, r-oldrel-macos-x86_64, r-oldrel-windows-x86_64
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.
Health stats visible at Monitor.