Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
DISTRIBUTED ALGORITHMS FOR BASIS PURSUIT Joo F. C. Mota
 

Summary: DISTRIBUTED ALGORITHMS FOR BASIS PURSUIT
Joćo F. C. Mota
, Joćo M. F. Xavier
, Pedro M. Q. Aguiar
, Markus Püschel

Institute for Systems and Robotics / IST, Lisboa, Portugal
{jmota,jxavier,aguiar}@isr.ist.utl.pt

Department of Electrical and Computer Engineering
Carnegie Mellon University Pittsburgh, PA, USA
pueschel@ece.cmu.edu
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. Ap-
plications include signal compression and modeling, estimation, fit-
ting, and compressed sensing. In this paper, we explore methods
for solving the BP in a distributed environment, i.e., when the com-
putational resources and the matrix A are distributed over several

  

Source: Aguiar, Pedro M. Q. - Institute for Systems and Robotics (Lisbon)
Institute for Systems and Robotics, Lisboa

 

Collections: Engineering