Algorithmic study of l₂,1-norm minimization problems
From MaRDI portal
Publication:5398907
Recommendations
- scientific article; zbMATH DE number 62436
- New nonsmooth equations-based algorithms for _1-norm minimization and applications
- scientific article; zbMATH DE number 24382
- Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
Cited in
(11)- Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints
- SOR- and Jacobi-type iterative methods for solving _1 - _2 problems by way of Fenchel duality
- A new algorithm for minimax andl1-norm optimization
- Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems
- A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection
- A unified approach for minimizing composite norms
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
- Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
- Least absolute deviations learning of multiple tasks
This page was built for publication: Algorithmic study of \(l_{2,1}\)-norm minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398907)
