A convergent iterative hard thresholding for nonnegative sparsity optimization
From MaRDI portal
Publication:3134091
zbMATH Open1384.90078MaRDI QIDQ3134091FDOQ3134091
Authors: Lili Pan, Sheng-Long Zhou, Naihua Xiu, Houduo Qi
Publication date: 8 February 2018
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol13/p325.html
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
convergenceconvergence ratenumerical experimentsparsity constrained optimizationimproved iterative hard thresholding
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cited In (13)
- Newton method for \(\ell_0\)-regularized optimization
- A quadratic penalty method for hypergraph matching
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
- An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression
- Title not available (Why is that?)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models
- Revisiting augmented Lagrangian duals
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- A greedy Newton-type method for multiple sparse constraint problem
- A Lagrange-Newton algorithm for sparse nonlinear programming
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)