We present a novel primal-dual analysis on a class of NPhard sparsity minimization problems to provide new interpretations for their well known convex relaxations. We show that th...
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
Daniel Thompson, Zachary T. Harmany, Roummel F. Ma...
This paper presents a fast algorithm for restoring video sequences. The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of im...
Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gi...
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...