Distributed Basis Pursuit

DOI10.1109/TSP.2011.2182347MaRDI QIDQ4573638zbMATH OpenOpenAlexFDO

Authors João F. C. Mota, João Xavier, Pedro M. Q. Aguiar, Markus Püschel

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1009.1128

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Convex programming (90C25)

Abstract: We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear system Ax = b and is used, for example, in compressed sensing for reconstruction. Our algorithm solves BP on a distributed platform such as a sensor network, and is designed to minimize the communication between nodes. The algorithm only requires the network to be connected, has no notion of a central processing node, and no node has access to the entire matrix A at any time. We consider two scenarios in which either the columns or the rows of A are distributed among the compute nodes. Our algorithm, named D-ADMM, is a decentralized implementation of the alternating direction method of multipliers. We show through numerical simulation that our algorithm requires considerably less communications between the nodes than the state-of-the-art algorithms.

Recommendations

• Distributed reconstruction via alternating direction method
• scientific article; zbMATH DE number 4049021
• Distributed block coordinate descent for minimizing partially separable functions
• Distributed iteratively reweighted least squares and applications
• Dictionary Learning Over Distributed Models
• Exact spectral-like gradient method for distributed optimization
• Distributed kernel-based gradient descent algorithms
• Fusion frames and distributed sparsity
• Design and Analysis of a Greedy Pursuit for Distributed Compressed Sensing
• Distributed estimation and quantization

Cited in

(5)

• Instrumental variable-based OMP identification algorithm for Hammerstein systems
• Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method
• A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
• Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method
• On the convergence of decentralized gradient descent

This page was built for publication: Distributed Basis Pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573638)