A Bregman iterative algorithm for solving \(l^1\) minimization problems
From MaRDI portal
Publication:2859933
DOI10.3724/SP.J.1160.2012.00365zbMATH Open1289.90253OpenAlexW2330737223MaRDI QIDQ2859933
Publication date: 19 November 2013
Published in: Acta Analysis Functionalis Applicata. AAFA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3724/sp.j.1160.2012.00365
Ill-posedness and regularization problems in numerical linear algebra (65F22) Minimax problems in mathematical programming (90C47) Iterative numerical methods for linear systems (65F10)
Related Items (4)
Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization ⋮ A modified Bland's rule for solving \(l_1\) norm minimization ⋮ A new spectral method for \(l_1\)-regularized minimization ⋮ Iterating Bregman Retractions
This page was built for publication: A Bregman iterative algorithm for solving \(l^1\) minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859933)
