Convergence of iterative hard-thresholding algorithm with continuation

DOI10.1007/S11590-016-1062-0zbMath1394.90533OpenAlexW2466348787MaRDI QIDQ523178

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

zbMATH Keywords

convergence analysiscontinuation\(\ell ^0\)-regularized minimizationiterative hard-thresholding algorithmKurdyka-Łojasiewicz function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• Iterative thresholding for sparse approximations
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• Nonsmooth analysis of singular values. I: Theory
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Decoding by Linear Programming
• Variational Analysis
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Convex Analysis
• Compressed sensing

This page was built for publication: Convergence of iterative hard-thresholding algorithm with continuation