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. 1501.00622
  4. Cited By
Strong NP-Hardness for Sparse Optimization with Concave Penalty
  Functions

Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions

4 January 2015
Yichen Chen
Dongdong Ge
Mengdi Wang
Zizhuo Wang
Yinyu Ye
Hao Yin
ArXivPDFHTML

Papers citing "Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions"

3 / 3 papers shown
Title
Optimal computational and statistical rates of convergence for sparse
  nonconvex learning problems
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
Zhaoran Wang
Han Liu
Tong Zhang
90
175
0
20 Jun 2013
Complexity of Unconstrained L_2-L_p Minimization
Complexity of Unconstrained L_2-L_p Minimization
Xiaojun Chen
Dongdong Ge
Zizhuo Wang
Yinyu Ye
57
138
0
03 May 2011
Rejoinder: One-step sparse estimates in nonconcave penalized likelihood
  models
Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models
H. Zou
Runze Li
219
1,233
0
07 Aug 2008
1