A Linearized Bregman Algorithm for Decentralized Basis Pursuit

Simple item page
dc.contributor.authorYuan, K.
dc.contributor.authorLing, Q.
dc.contributor.authorYin, W.
dc.contributor.authorRibeiro, A.
dc.date.accessioned2018-06-19T17:48:49Z
dc.date.available2018-06-19T17:48:49Z
dc.date.issued2013-04
dc.date.noteApril 2013
dc.description.abstractWe solve a decentralized basis pursuit problem in a multiagent system, where each agent holds part of the linear observations on a common sparse vector, and all the agents collaborate to recover the sparse vector through limited neighbor-to-neighbor communication. The proposed decentralized linearized Bregman algorithm solves the Lagrange dual of an augmented l1 model that is equivalent to basis pursuit. The fact that this dual problem is unconstrained and differentiable enables a lightweight yet efficient decentralized gradient algorithm. We prove nearly linear convergence of the algorithm in the sense that uniformly for every agent i, the error obeys |x_i(k) - x*|<=e(k) and e(k)<=rho e(k-1)+gamma, where rho<=1 and gamma>=0 are independent of k or i. Numerical experiments demonstrate this convergence.
dc.format.extent5 pp
dc.identifier.citationYuan, K., Ling, Q., Yin, W., et al.. "A Linearized Bregman Algorithm for Decentralized Basis Pursuit." (2013) <a href="https://hdl.handle.net/1911/102218">https://hdl.handle.net/1911/102218</a>.
dc.identifier.digitalTR13-06
dc.identifier.urihttps://hdl.handle.net/1911/102218
dc.language.isoeng
dc.titleA Linearized Bregman Algorithm for Decentralized Basis Pursuit
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR13-06.PDF
Size:
212.52 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports