ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.00119
  4. Cited By
Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to
  Non-smooth Concave Maximization

Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization

1 March 2017
Bo Liu
Xiaotong Yuan
Lezi Wang
Qingshan Liu
Dimitris N. Metaxas
ArXivPDFHTML

Papers citing "Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization"

2 / 2 papers shown
Title
Convergence of the mini-batch SIHT algorithm
Convergence of the mini-batch SIHT algorithm
S. Damadi
Jinglai Shen
14
2
0
29 Sep 2022
Stochastic Iterative Hard Thresholding for Graph-structured Sparsity
  Optimization
Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization
Baojian Zhou
F. Chen
Yiming Ying
29
7
0
09 May 2019
1