Sciweavers

18 search results - page 2 / 4
» Gradient projection for linearly constrained convex optimiza...
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 10 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 8 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 8 months ago
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
Wei Wang, Martin J. Wainwright, Kannan Ramchandran
ICIP
2009
IEEE
14 years 9 months ago
Monotone Operator Splitting For Optimization Problems In Sparse Recovery
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
TIT
2010
174views Education» more  TIT 2010»
13 years 3 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...