pbombina/ADMM: ADMM to solve dense submatrix problem
Iteratively solves the problem of identifying the densest mn-submatrix in a given or sampled binary matrix. The problem is formulated as convex relaxation using nuclear and L_1 norms. This method works for matrices containig a single dense submatrix.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Brendan Ames <bpames@ua.edu>, Polina Bombina <pbombina@crimson.ua.edu> |
| Maintainer | Brendan Ames <bpames@ua.edu>, Polina Bombina <pbombina@crimson.ua.edu> |
| License | MIT |
| Version | 0.1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
