A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
From MaRDI portal
Publication:6590598
DOI10.1007/s11075-023-01700-zMaRDI QIDQ6590598
Publication date: 21 August 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
nonconvex and nonsmooth\( \ell_0\) regularizationtwo-metric variable scaled forward-backward algorithmvariable metric forward-backward method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Subgradient methods for sharp weakly convex functions
- A family of variable metric proximal methods
- Descentwise inexact proximal algorithms for smooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Variable metric techniques for forward-backward methods in imaging
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Minimization of functions having Lipschitz continuous first partial derivatives
- Scaling Techniques for $\epsilon$-Subgradient Methods
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- Introduction to Nonsmooth Optimization
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Redundant Representations
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Variable Metric Method for Minimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- First-Order Methods in Optimization
- Successive Concave Sparsity Approximation for Compressed Sensing
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- The indefinite proximal point algorithms for maximal monotone operators
- Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
- Composite Optimization by Nonconvex Majorization-Minimization
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- A class of nonlinear proximal point algorithms for variational inequality problems
- A Rapidly Convergent Descent Method for Minimization
- ``Efficient” Subgradient Methods for General Convex Optimization
- Compressed sensing
This page was built for publication: A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications