Distributed algorithms for basis pursuit

Abstract : The Basis Pursuit (BP) problem consists in finding a least `1 norm solution of the underdetermined linear system Ax = b. It arises in many areas of electrical engineering and applied mathematics. Applications include signal compression and modeling, estimation, fitting, and compressed sensing. In this paper, we explore methods for solving the BP in a distributed environment, i.e., when the computational resources and the matrix A are distributed over several interconnected nodes. Special instances of this distributed framework include sensor networks and distributed memory and/or processor platforms. We consider two distribution paradigms: either the columns or the rows of A are distributed across the nodes. The several algorithms that we present impose distinct requirements on the degree of connectivity of the network and the per-node computational complexity.
Type de document :
Communication dans un congrès
Rémi Gribonval. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Apr 2009, Saint Malo, France. 2009
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00369431
Contributeur : Ist Rennes <>
Soumis le : jeudi 19 mars 2009 - 16:58:51
Dernière modification le : mercredi 27 décembre 2017 - 09:46:01
Document(s) archivé(s) le : mardi 8 juin 2010 - 23:40:39

Fichier

22.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00369431, version 1

Collections

Citation

João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, Markus Püschel. Distributed algorithms for basis pursuit. Rémi Gribonval. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Apr 2009, Saint Malo, France. 2009. 〈inria-00369431〉

Partager

Métriques

Consultations de la notice

167

Téléchargements de fichiers

134