BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

293 related articles for article (PubMed ID: 29391859)

  • 1. MOCCA: Mirrored Convex/Concave Optimization for Nonconvex Composite Functions.
    Barber RF; Sidky EY
    J Mach Learn Res; 2016; 17(144):1-51. PubMed ID: 29391859
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Convergence for nonconvex ADMM, with applications to CT imaging.
    Barber RF; Sidky EY
    J Mach Learn Res; 2024; 25():. PubMed ID: 38855262
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Scalable Proximal Jacobian Iteration Method With Global Convergence Analysis for Nonconvex Unconstrained Composite Optimizations.
    Zhang H; Qian J; Gao J; Yang J; Xu C
    IEEE Trans Neural Netw Learn Syst; 2019 Sep; 30(9):2825-2839. PubMed ID: 30668503
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An Extended Primal-Dual Algorithm Framework for Nonconvex Problems: Application to Image Reconstruction in Spectral CT.
    Gao Y; Pan X; Chen C
    Inverse Probl; 2022 Aug; 38(8):. PubMed ID: 36185463
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Proximal Distance Algorithms: Theory and Practice.
    Keys KL; Zhou H; Lange K
    J Mach Learn Res; 2019 Apr; 20():. PubMed ID: 31649491
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Fast and accurate matrix completion via truncated nuclear norm regularization.
    Hu Y; Zhang D; Ye J; Li X; He X
    IEEE Trans Pattern Anal Mach Intell; 2013 Sep; 35(9):2117-30. PubMed ID: 23868774
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. 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]  

  • 9. Inertial proximal alternating minimization for nonconvex and nonsmooth problems.
    Zhang Y; He S
    J Inequal Appl; 2017; 2017(1):232. PubMed ID: 29026279
    [TBL] [Abstract][Full Text] [Related]  

  • 10. I-LAMM FOR SPARSE LEARNING: SIMULTANEOUS CONTROL OF ALGORITHMIC COMPLEXITY AND STATISTICAL ERROR.
    Fan J; Liu H; Sun Q; Zhang T
    Ann Stat; 2018 Apr; 46(2):814-841. PubMed ID: 29930436
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Low-rank structure learning via nonconvex heuristic recovery.
    Deng Y; Dai Q; Liu R; Zhang Z; Hu S
    IEEE Trans Neural Netw Learn Syst; 2013 Mar; 24(3):383-96. PubMed ID: 24808312
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization.
    Chen L; Jiang X; Liu X; Zhou Z
    IEEE Trans Image Process; 2020 Sep; PP():. PubMed ID: 32946392
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. Efficient algorithm for nonconvex minimization and its application to PM regularization.
    Li WP; Wang ZM; Deng Y
    IEEE Trans Image Process; 2012 Oct; 21(10):4322-33. PubMed ID: 22829405
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Direct-Optimization-Based DC Dictionary Learning With the MCP Regularizer.
    Li Z; Yang Z; Zhao H; Xie S
    IEEE Trans Neural Netw Learn Syst; 2023 Jul; 34(7):3568-3579. PubMed ID: 34633934
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation.
    Bian W; Chen X
    IEEE Trans Neural Netw Learn Syst; 2014 Mar; 25(3):545-56. PubMed ID: 24807450
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A Nonconvex Optimization Framework for Low Rank Matrix Estimation.
    Zhao T; Wang Z; Liu H
    Adv Neural Inf Process Syst; 2015; 28():559-567. PubMed ID: 28316458
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces.
    Boţ RI; Csetnek ER; Meier D
    Optim Methods Softw; 2019; 34(3):489-514. PubMed ID: 31057305
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms.
    Carretero JA; Nahon MA
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1144-55. PubMed ID: 16366241
    [TBL] [Abstract][Full Text] [Related]  

  • 20. First-order convex feasibility algorithms for x-ray CT.
    Sidky EY; Jørgensen JS; Pan X
    Med Phys; 2013 Mar; 40(3):031115. PubMed ID: 23464295
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 15.