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

l1l_1 regularization parameter

opt_tol

stopping tolerance in algorithm

maxiter

maximum number of iterations of the algorithm to run

quiet

toggles between displaying intermediate statistics

Details

minX+gammaY1+1OmegaW(W)+1OmegaQ(Q)+1OmegaZ(Z)min |X|_* + gamma* |Y|_1 + 1_Omega_W (W) + 1_Omega_Q (Q) + 1_Omega_Z (Z)

s.t XY=0X - Y = 0, X=WX = W, X=ZX = Z,

where OmegaW(W)Omega_W (W), OmegaQ(Q)Omega_Q (Q), OmegaZ(Z)Omega_Z (Z) are the sets: OmegaW=WinRMxNeTWe=mnOmega_W = {W in R^MxN | e^TWe = mn}

OmegaQ=QinRMxNProjectionofQonnotN=0Omega_Q = {Q in R^MxN | Projection of Q on not N = 0}

OmegaZ=ZinRMxNZij<=1forall(i,j)inMxNOmega_Z = {Z in R^MxN | Z_ij <= 1 for all (i,j) in M x N}

OmegaQ=QinRMxNProjectionofQonnotN=0Omega_Q = {Q in R^MxN | Projection of Q on not N = 0}

OmegaZ=ZinRMxNZij<=1forall(i,j)inMxNOmega_Z = {Z in R^MxN | Z_ij <= 1 for all (i,j) in M x N}

1S1_S is the indicator function of the set SS in RMxNR^MxN such that 1S(X)=01_S(X) = 0 if XX in SS and +infinity otherwise

Value

Rank one matrix with mnmn nonzero entries, matrix YY that is used to count the number of disagreements between GG and XX


[Package admmDensestSubmatrix version 0.1.0 Index]