The proximal alternating iterative hard thresholding method for l₀ minimization, with complexity O(1/k)

DOI10.1016/J.CAM.2016.07.013MaRDI QIDQ730526zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 28 December 2016

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2016.07.013

zbMATH Keywords

alternating minimizationhard thresholdingimage restorationKurdyka-Łojasiewicz propertysparse approximationtight wavelet frame

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Image restoration by minimizing zero norm of wavelet frame coefficients
• $\ell _0$ Minimization for wavelet frame based image restoration
• An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
• An efficient nonconvex regularization for wavelet frame and total variation based image restoration
• Wavelet frame based image restoration via combined sparsity and nonlocal prior of coefficients

Cites work

• $\ell _0$ Minimization for wavelet frame based image restoration
• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
• BM3D Frames and Variational Image Deblurring
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Convergence analysis for iterative data-driven tight frame construction scheme
• scientific article; zbMATH DE number 3371284 (Why is no real title available?)
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
• Iterative thresholding for sparse approximations
• On gradients of functions definable in o-minimal structures
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Sparse Approximation via Penalty Decomposition Methods
• Split Bregman methods and frame based image restoration
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

Cited in

(7)

• A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
• A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
• Wavelet tight frame and prior image-based image reconstruction from limited-angle projection data
• Image restoration by minimizing zero norm of wavelet frame coefficients
• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
• An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model

Describes a project that uses

Uses Software

• BM3D

This page was built for publication: The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730526)