Pages that link to "Item:Q463721"
From MaRDI portal
The following pages link to Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721):
Displaying 27 items.
- A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case (Q2040452) (← links)
- Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
- The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems (Q2231049) (← links)
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method (Q2273119) (← links)
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization (Q2311987) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms (Q2800370) (← links)
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming (Q2957850) (← links)
- Iterative Hard-Thresholding Applied to Optimal Control Problems with $L^0(\Omega)$ Control Cost (Q3119535) (← links)
- Disparity and optical flow partitioning using extended Potts priors (Q4603694) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation (Q5081098) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Zero norm based analysis model for image smoothing and reconstruction (Q5139309) (← links)
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
- (Q5159402) (← links)
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms (Q5219700) (← links)
- Grouped variable selection with discrete optimization: computational and statistical perspectives (Q6046300) (← links)
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates (Q6051201) (← links)
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)