A graph-decomposition ADMM algorithm for graph-fused lasso moves part of the total-variation penalty into the x-update, giving smaller per-iteration cost and faster empirical convergence than network lasso.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Algorithm for Graph-Fused Lasso Based on Graph Decomposition
A graph-decomposition ADMM algorithm for graph-fused lasso moves part of the total-variation penalty into the x-update, giving smaller per-iteration cost and faster empirical convergence than network lasso.