Iteratively reweighted algorithms for compressive sensing

R Chartrand, W Yin - 2008 IEEE international conference on …, 2008 - ieeexplore.ieee.org
The theory of compressive sensing has shown that sparse signals can be reconstructed
exactly from many fewer measurements than traditionally believed necessary. In [1], it was …

Sparse Bayesian learning for basis selection

DP Wipf, BD Rao - IEEE Transactions on Signal processing, 2004 - ieeexplore.ieee.org
Sparse Bayesian learning (SBL) and specifically relevance vector machines have received
much attention in the machine learning literature as a means of achieving parsimonious …

[图书][B] Adaptive blind signal and image processing: learning algorithms and applications

A Cichocki, S Amari - 2002 - books.google.com
With solid theoretical foundations and numerous potential applications, Blind Signal
Processing (BSP) is one of the hottest emerging areas in Signal Processing. This volume …

Comparing measures of sparsity

N Hurley, S Rickard - IEEE Transactions on Information Theory, 2009 - ieeexplore.ieee.org
Sparsity of representations of signals has been shown to be a key concept of fundamental
importance in fields such as blind source separation, compression, sampling and signal …

Sparse solutions to linear inverse problems with multiple measurement vectors

SF Cotter, BD Rao, K Engan… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
We address the problem of finding sparse solutions to an underdetermined system of
equations when there are multiple measurement vectors having the same, but unknown …

Distributed nonconvex constrained optimization over time-varying digraphs

G Scutari, Y Sun - Mathematical Programming, 2019 - Springer
This paper considers nonconvex distributed constrained optimization over networks,
modeled as directed (possibly time-varying) graphs. We introduce the first algorithmic …

Exact reconstruction of sparse signals via nonconvex minimization

R Chartrand - IEEE Signal Processing Letters, 2007 - ieeexplore.ieee.org
Several authors have shown recently that It is possible to reconstruct exactly a sparse signal
from fewer linear measurements than would be expected from traditional sampling theory …

Just relax: Convex programming methods for identifying sparse signals in noise

JA Tropp - IEEE transactions on information theory, 2006 - ieeexplore.ieee.org
This paper studies a difficult and fundamental problem that arises throughout electrical
engineering, applied mathematics, and statistics. Suppose that one forms a short linear …

Dictionary learning algorithms for sparse representation

K Kreutz-Delgado, JF Murray, BD Rao, K Engan… - Neural …, 2003 - direct.mit.edu
Algorithms for data-driven learning of domain-specific overcomplete dictionaries are
developed to obtain maximum likelihood and maximum a posteriori dictionary estimates …

[PDF][PDF] Iterative reweighted algorithms for matrix rank minimization

K Mohan, M Fazel - The Journal of Machine Learning Research, 2012 - jmlr.org
The problem of minimizing the rank of a matrix subject to affine constraints has applications
in several areas including machine learning, and is known to be NP-hard. A tractable …