Nonconvex sparse regularization and splitting algorithms
From MaRDI portal
Recommendations
- A three-operator splitting algorithm for nonconvex sparsity regularization
- A non-convex piecewise quadratic approximation of _0 regularization: theory and accelerated algorithm
- Operator splitting methods in compressive sensing and sparse approximation
- A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging
- \(l_1\)-\(l_2\) regularization of split feasibility problems
Cited in
(13)- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- On the proximal gradient algorithm with alternated inertia
- Operator splitting methods in compressive sensing and sparse approximation
- Improved Pathwise Coordinate Descent for Power Penalties
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- Sparse Regularization via Convex Analysis
- Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
- Nonconvex regularization for sparse neural networks
- Algorithmic versatility of SPF-regularization methods
- Nonconvex Sparse Regularization for Deep Neural Networks and Its Optimality
- A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems
- A three-operator splitting algorithm for nonconvex sparsity regularization
- \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement
This page was built for publication: Nonconvex sparse regularization and splitting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350479)
