Sciweavers

207 search results - page 4 / 42
» Convexity of the Proximal Average
Sort
View
TIT
2010
137views Education» more  TIT 2010»
13 years 2 months ago
Average case analysis of multichannel sparse recovery using convex relaxation
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
Yonina C. Eldar, Holger Rauhut
SIAMJO
2010
84views more  SIAMJO 2010»
13 years 5 months ago
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
Warren Hare, Claudia A. Sagastizábal
JMLR
2012
11 years 10 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
WICOMM
2010
91views more  WICOMM 2010»
13 years 5 months ago
A sensing-based cognitive coexistence method for interfering infrastructure and ad hoc systems
The rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an in...
Stefan Geirhofer, Lang Tong, Brian M. Sadler
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
14 years 1 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou