A gradient based method for the L₂-L₁/2 minimization and application to compressive sensing
From MaRDI portal
Publication:4979595
Recommendations
- Optimality conditions for the \(L_{1/2}\) regularization problem and a descent method
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- A gradient descent based algorithm for \(\ell_p\) minimization
- Algorithmic study of \(l_{2,1}\)-norm minimization problems
Cited in
(11)- scientific article; zbMATH DE number 6907423 (Why is no real title available?)
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- A reduced half thresholding algorithm
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- A box constrained gradient projection algorithm for compressed sensing
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- A gradient descent based algorithm for \(\ell_p\) minimization
- Optimality conditions for the \(L_{1/2}\) regularization problem and a descent method
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
This page was built for publication: A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979595)
