densub {admmDensestSubmatrix} | R Documentation |
densub
Description
Iteratively solves the convex optimization problem using ADMM.
Usage
densub(G, m, n, tau = 0.35, gamma = 6/(sqrt(m * n) * (q - p)),
opt_tol = 1e-04, maxiter, quiet = TRUE)
Arguments
G |
sampled binary matrix |
m |
number of rows in dense submatrix |
n |
number of columns in dense submatrix |
tau |
penalty parameter for equality constraint violation |
gamma |
|
opt_tol |
stopping tolerance in algorithm |
maxiter |
maximum number of iterations of the algorithm to run |
quiet |
toggles between displaying intermediate statistics |
Details
s.t ,
,
,
where ,
,
are the sets:
is the indicator function of the set
in
such that
if
in
and +infinity otherwise
Value
Rank one matrix with nonzero entries, matrix
that is used to count the number of disagreements between
and
[Package admmDensestSubmatrix version 0.1.0 Index]