Name
Abstract | ||
|---|---|---|
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 column selection strategy, derived from adaptive matching pursuit, also fuses the received neighbor information with local data. The algorithm provides good performance with limited inter node communication and relatively low computational complexity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISPACS.2013.6704605 | Intelligent Signal Processing and Communications Systems |
Keywords | Field | DocType |
computational complexity,data communication,greedy algorithms,iterative methods,adaptive matching pursuit,column selection strategy,computational complexity,distributed adaptive algorithm,distributed coordinate descent,greedy algorithm,inter node communication,linear equations,local data,neighbor nodes,received neighbor information,sparse solutions,coordinate descent,distributed algorithm,greedy algorithm,matching pursuit,sparse filters | Matching pursuit,Mathematical optimization,System of linear equations,Computer science,Iterative method,Greedy algorithm,Adaptive algorithm,Coordinate descent,Greedy randomized adaptive search procedure,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
978-1-4673-6360-0 | 0 | 0.34 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandru Onose | 1 | 12 | 3.93 |
| Bogdan Dumitrescu | 2 | 107 | 22.76 |