Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
From MaRDI portal
Publication:463721
DOI10.1007/s10107-013-0714-4zbMath1308.65094arXiv1211.0056OpenAlexW2963292690MaRDI QIDQ463721
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0056
sparse approximationiteration complexity\(l_0\) regularizationbox constrained convex programmingconvex cone programmingiterative hard thresholding method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items (27)
Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation ⋮ Newton method for \(\ell_0\)-regularized optimization ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Grouped variable selection with discrete optimization: computational and statistical perspectives ⋮ Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates ⋮ Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound ⋮ Efficient nonconvex sparse group feature selection via continuous and discrete optimization ⋮ Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem ⋮ An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ Disparity and optical flow partitioning using extended Potts priors ⋮ Zero norm based analysis model for image smoothing and reconstruction ⋮ The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems ⋮ Homotopy method for matrix rank minimization based on the matrix hard thresholding method ⋮ The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) ⋮ On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms ⋮ Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case ⋮ Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms ⋮ Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem ⋮ A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization ⋮ Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms ⋮ Weighted thresholding homotopy method for sparsity constrained optimization ⋮ Iterative Hard-Thresholding Applied to Optimal Control Problems with $L^0(\Omega)$ Control Cost ⋮ Unnamed Item ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model * ⋮ A note on the complexity of proximal iterative hard thresholding algorithm
Cites Work
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Introductory lectures on convex optimization. A basic course.
- Iteration-complexity of first-order penalty methods for convex programming
- Normalized Iterative Hard Thresholding for Matrix Completion
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greed is Good: Algorithmic Results for Sparse Approximation
- Two-Point Step Size Gradient Methods
- Matching pursuits with time-frequency dictionaries
- Greedy Sparsity-Constrained Optimization
- Sparse Approximation via Penalty Decomposition Methods
- Compressed sensing
This page was built for publication: Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
