These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

125 related articles for article (PubMed ID: 31680704)

  • 1. Sample Average Approximation with Sparsity-Inducing Penalty for High-Dimensional Stochastic Programming.
    Liu H; Wang X; Yao T; Li R; Ye Y
    Math Program; 2019 Nov; 78(1-2):69-108. PubMed ID: 31680704
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions.
    Liu H; Yao T; Li R; Ye Y
    Math Program; 2017 Nov; 166(1-2):207-240. PubMed ID: 29225375
    [TBL] [Abstract][Full Text] [Related]  

  • 3. GLOBAL SOLUTIONS TO FOLDED CONCAVE PENALIZED NONCONVEX LEARNING.
    Liu H; Yao T; Li R
    Ann Stat; 2016 Apr; 44(2):629-659. PubMed ID: 27141126
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Convex compressive beamforming with nonconvex sparse regularization.
    Yang Y; Du Z; Wang Y; Guo X; Yang L; Zhou J
    J Acoust Soc Am; 2021 Feb; 149(2):1125. PubMed ID: 33639805
    [TBL] [Abstract][Full Text] [Related]  

  • 5. STRONG ORACLE OPTIMALITY OF FOLDED CONCAVE PENALIZED ESTIMATION.
    Fan J; Xue L; Zou H
    Ann Stat; 2014 Jun; 42(3):819-849. PubMed ID: 25598560
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Folded concave penalized learning of high-dimensional MRI data in Parkinson's disease.
    Li C; Wang X; Du G; Chen H; Brown G; Lewis MM; Yao T; Li R; Huang X
    J Neurosci Methods; 2021 Jun; 357():109157. PubMed ID: 33781789
    [TBL] [Abstract][Full Text] [Related]  

  • 7. OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS.
    Wang Z; Liu H; Zhang T
    Ann Stat; 2014; 42(6):2164-2201. PubMed ID: 25544785
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Non-Concave Penalized Likelihood with NP-Dimensionality.
    Fan J; Lv J
    IEEE Trans Inf Theory; 2011 Aug; 57(8):5467-5484. PubMed ID: 22287795
    [TBL] [Abstract][Full Text] [Related]  

  • 9. lp-lq penalty for sparse linear and sparse multiple kernel multitask learning.
    Rakotomamonjy A; Flamary R; Gasso G; Canu S
    IEEE Trans Neural Netw; 2011 Aug; 22(8):1307-20. PubMed ID: 21813358
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Feature Selection With $\ell_{2,1-2}$ Regularization.
    Yong Shi ; Jianyu Miao ; Zhengyu Wang ; Peng Zhang ; Lingfeng Niu
    IEEE Trans Neural Netw Learn Syst; 2018 Oct; 29(10):4967-4982. PubMed ID: 29994757
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time.
    Wang Z; Lu H; Liu H
    Adv Neural Inf Process Syst; 2014; 2014():3383-3391. PubMed ID: 25620858
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Hyperspectral Images Denoising via Nonconvex Regularized Low-Rank and Sparse Matrix Decomposition.
    Xie T; Li S; Sun B
    IEEE Trans Image Process; 2020; 29():44-56. PubMed ID: 31329555
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A few theoretical results for Laplace and arctan penalized ordinary least squares linear regression estimators.
    John M; Vettam S
    Commun Stat Theory Methods; 2024; 53(13):4819-4840. PubMed ID: 38895616
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On a Monotone Scheme for Nonconvex Nonsmooth Optimization with Applications to Fracture Mechanics.
    Ghilli D; Kunisch K
    J Optim Theory Appl; 2019; 183(2):609-641. PubMed ID: 31975742
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Regularization Methods for High-Dimensional Instrumental Variables Regression With an Application to Genetical Genomics.
    Lin W; Feng R; Li H
    J Am Stat Assoc; 2015; 110(509):270-288. PubMed ID: 26392642
    [TBL] [Abstract][Full Text] [Related]  

  • 16. l
    Brbic M; Kopriva I
    IEEE Trans Cybern; 2020 Apr; 50(4):1711-1725. PubMed ID: 30561362
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Newton-Raphson Meets Sparsity: Sparse Learning Via a Novel Penalty and a Fast Solver.
    Cao Y; Kang L; Li X; Liu Y; Luo Y; Shi Y
    IEEE Trans Neural Netw Learn Syst; 2024 Sep; 35(9):12057-12067. PubMed ID: 37028319
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces.
    Geiersbach C; Scarinci T
    Comput Optim Appl; 2021; 78(3):705-740. PubMed ID: 33707813
    [TBL] [Abstract][Full Text] [Related]  

  • 19. NOISY MATRIX COMPLETION: UNDERSTANDING STATISTICAL GUARANTEES FOR CONVEX RELAXATION VIA NONCONVEX OPTIMIZATION.
    Chen Y; Chi Y; Fan J; Ma C; Yan Y
    SIAM J Optim; 2020; 30(4):3098-3121. PubMed ID: 34305368
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Global Search and Analysis for the Nonconvex Two-Level ℓ₁ Penalty.
    He F; He M; Shi L; Huang X
    IEEE Trans Neural Netw Learn Syst; 2024 Mar; 35(3):3886-3899. PubMed ID: 36040939
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.