A convergent iterative hard thresholding for nonnegative sparsity optimization
From MaRDI portal
Recommendations
- Iterative positive thresholding algorithm for non-negative sparse optimization
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
- A note on the complexity of proximal iterative hard thresholding algorithm
- Between hard and soft thresholding: optimal iterative thresholding algorithms
Cited in
(21)- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Revisiting augmented Lagrangian duals
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- A note on the complexity of proximal iterative hard thresholding algorithm
- Newton method for \(\ell_0\)-regularized optimization
- A greedy Newton-type method for multiple sparse constraint problem
- Iterative positive thresholding algorithm for non-negative sparse optimization
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Dual iterative hard thresholding
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
- An inexact projected gradient method for sparsity-constrained quadratic measurements regression
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
- A quadratic penalty method for hypergraph matching
- Optimality conditions for non-negative group sparse constrained optimization problems
- Efficient sparse probability measures recovery via Bregman gradient
- Sparse projection onto semi-symmetric sets with applications to sparse optimization
This page was built for publication: A convergent iterative hard thresholding for nonnegative sparsity optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134091)
