Distributed coordinate descent using adaptive matching pursuit


We propose a distributed adaptive algorithm for finding sparse solutions to systems of linear equations. The algorithm is greedy in nature. At each time moment, it first combines the current nonzero elements of the solution received from neighbor nodes by averaging them and then adapts the solution via a coordinate descent update using the local data. The… (More)
DOI: 10.1109/ISPACS.2013.6704605


6 Figures and Tables

Slides referencing similar topics