A simple and efficient algorithm for fused lasso signal approximator with convex loss function
From MaRDI portal
Publication:2259092
DOI10.1007/s00180-012-0373-6zbMath1306.65147arXiv1005.5085OpenAlexW1992903458MaRDI QIDQ2259092
Yuan You, Heng Lian, Li-chun Wang
Publication date: 27 February 2015
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.5085
Related Items (2)
A new active zero set descent algorithm for least absolute deviation with generalized LASSO penalty ⋮ Double fused Lasso regularized regression with both matrix and vector valued predictors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternating direction augmented Lagrangian methods for semidefinite programming
- One-step sparse estimates in nonconcave penalized likelihood models
- Pathwise coordinate optimization
- Multiplier and gradient methods
- Piecewise linear regularized solution paths
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Augmented Lagrangian Method, Dual Methods and Split Bregman Iteration for ROF Model
- Spatial smoothing and hot spot detection for CGH data using the fused lasso
- Sparsity and Smoothness Via the Fused Lasso
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Convex Analysis
This page was built for publication: A simple and efficient algorithm for fused lasso signal approximator with convex loss function
