Last updated on 2026-04-25 13:50:29 CEST.
| Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
|---|---|---|---|---|---|---|
| r-devel-linux-x86_64-debian-clang | 1.0 | 5.11 | 53.74 | 58.85 | NOTE | |
| r-devel-linux-x86_64-debian-gcc | 1.0 | 3.75 | 41.86 | 45.61 | NOTE | |
| r-devel-linux-x86_64-fedora-clang | 1.0 | 10.00 | 94.88 | 104.88 | NOTE | |
| r-devel-linux-x86_64-fedora-gcc | 1.0 | 8.00 | 81.57 | 89.57 | NOTE | |
| r-patched-linux-x86_64 | 1.0 | 4.56 | 51.11 | 55.67 | NOTE | |
| r-release-linux-x86_64 | 1.0 | 4.47 | 50.10 | 54.57 | NOTE | |
| r-release-macos-arm64 | 1.0 | 1.00 | 16.00 | 17.00 | NOTE | |
| r-release-macos-x86_64 | 1.0 | 4.00 | 72.00 | 76.00 | NOTE | |
| r-release-windows-x86_64 | 1.0 | 6.00 | 62.00 | 68.00 | NOTE | |
| r-oldrel-macos-arm64 | 1.0 | NOTE | ||||
| r-oldrel-macos-x86_64 | 1.0 | 3.00 | 44.00 | 47.00 | NOTE | |
| r-oldrel-windows-x86_64 | 1.0 | 8.00 | 64.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-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