admmDensestSubmatrix
Alternating Direction Method of Multipliers to Solve Dense Dubmatrix Problem
Solves the problem of identifying the densest submatrix in a given or sampled binary matrix, Bombina et al. (2019) <arXiv:1904.03272>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | admmDensestSubmatrix_0.1.0.tar.gz |
494.8 KiB |
0.1.0 |
rolling linux/noble R-4.5 | admmDensestSubmatrix_0.1.0.tar.gz |
494.6 KiB |
0.1.0 |
rolling source/ R- | admmDensestSubmatrix_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
latest linux/jammy R-4.5 | admmDensestSubmatrix_0.1.0.tar.gz |
494.8 KiB |
0.1.0 |
latest linux/noble R-4.5 | admmDensestSubmatrix_0.1.0.tar.gz |
494.6 KiB |
0.1.0 |
latest source/ R- | admmDensestSubmatrix_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
2026-04-26 source/ R- | admmDensestSubmatrix_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
2026-04-23 source/ R- | admmDensestSubmatrix_0.1.0.tar.gz |
1.0 MiB |
0.1.0 |
2026-04-09 windows/windows R-4.5 | admmDensestSubmatrix_0.1.0.zip |
497.4 KiB |
0.1.0 |
2025-04-20 source/ R- | admmDensestSubmatrix_0.1.0.tar.gz |
1.0 MiB |