Convergence of iterative hard-thresholding algorithm with continuation
DOI10.1007/S11590-016-1062-0zbMATH Open1394.90533OpenAlexW2466348787MaRDI QIDQ523178FDOQ523178
Authors: Tao Sun, Li-zhi Cheng 
Publication date: 20 April 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1062-0
Recommendations
- Linear convergence of iterative soft-thresholding
- A new linear convergence result for the iterative soft thresholding algorithm
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Convergence of an iterative algorithm for computing parameters of multi-valued threshold functions
- Convergence of an Iterative Method for Total Variation Denoising
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
- Iterative thresholding meets free-discontinuity problems
- Hard thresholding pursuit with continuation for \(\ell^{0}\)-regularized minimizations
- The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems
continuationconvergence analysis\(\ell ^0\)-regularized minimizationiterative hard-thresholding algorithm[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Kurdyka-%EF%BF%BD%EF%BF%BDojasiewicz+function&go=Go Kurdyka-��ojasiewicz function]
Cites Work
- Variational Analysis
- Decoding by Linear Programming
- Convex Analysis
- Compressed sensing
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Iterative thresholding for sparse approximations
- Nonsmooth analysis of singular values. I: Theory
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convergence of fixed-point continuation algorithms for matrix rank minimization
Cited In (7)
- A note on the complexity of proximal iterative hard thresholding algorithm
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Hard thresholding pursuit with continuation for \(\ell^{0}\)-regularized minimizations
- Iterative hard-thresholding applied to optimal control problems with \(L^0(\Omega)\) control cost
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Convergence of a threshold-type algorithm using the signed distance function
This page was built for publication: Convergence of iterative hard-thresholding algorithm with continuation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q523178)
