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. 1211.0056
  4. Cited By
Iterative Hard Thresholding Methods for $l_0$ Regularized Convex Cone
  Programming
v1v2 (latest)

Iterative Hard Thresholding Methods for l0l_0l0​ Regularized Convex Cone Programming

31 October 2012
Zhaosong Lu
ArXiv (abs)PDFHTML

Papers citing "Iterative Hard Thresholding Methods for $l_0$ Regularized Convex Cone Programming"

3 / 3 papers shown
Title
Sparse Approximation via Penalty Decomposition Methods
Sparse Approximation via Penalty Decomposition Methods
Zhaosong Lu
Yong Zhang
86
209
0
10 May 2012
Greedy Sparsity-Constrained Optimization
Greedy Sparsity-Constrained Optimization
S. Bahmani
Bhiksha Raj
P. Boufounos
105
197
0
25 Mar 2012
Guaranteed Rank Minimization via Singular Value Projection
Guaranteed Rank Minimization via Singular Value Projection
Raghu Meka
Prateek Jain
Inderjit S. Dhillon
183
554
0
30 Sep 2009
1