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 *

112 related articles for article (PubMed ID: 38357400)

  • 1. A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique.
    Karapetyants MA
    Comput Optim Appl; 2024; 87(2):531-569. PubMed ID: 38357400
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A fast continuous time approach with time scaling for nonsmooth convex optimization.
    Boţ RI; Karapetyants MA
    Adv Contin Discret Model; 2022; 2022(1):73. PubMed ID: 36540365
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Tikhonov regularization of a second order dynamical system with Hessian driven damping.
    Boţ RI; Csetnek ER; László SC
    Math Program; 2021; 189(1-2):151-186. PubMed ID: 34720194
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Neural network for constrained nonsmooth optimization using Tikhonov regularization.
    Qin S; Fan D; Wu G; Zhao L
    Neural Netw; 2015 Mar; 63():272-81. PubMed ID: 25590563
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A second-order dynamical system with Hessian-driven damping and penalty term associated to variational inequalities.
    Boţ RI; Csetnek ER
    Optimization; 2019; 68(7):1265-1277. PubMed ID: 31708645
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Neural network for a class of sparse optimization with L
    Wei Z; Li Q; Wei J; Bian W
    Neural Netw; 2022 Jul; 151():211-221. PubMed ID: 35439665
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Gradient regularization of Newton method with Bregman distances.
    Doikov N; Nesterov Y
    Math Program; 2024; 204(1-2):1-25. PubMed ID: 38371323
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates.
    Boţ RI; Csetnek ER; Nguyen DK
    Math Program; 2023; 200(1):147-197. PubMed ID: 37215306
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Variable Smoothing for Convex Optimization Problems Using Stochastic Gradients.
    Boţ RI; Böhm A
    J Sci Comput; 2020; 85(2):33. PubMed ID: 33122873
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Modified BFGS Formula Using a Trust Region Model for Nonsmooth Convex Minimizations.
    Cui Z; Yuan G; Sheng Z; Liu W; Wang X; Duan X
    PLoS One; 2015; 10(10):e0140606. PubMed ID: 26501775
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Projection Neural Network to Nonsmooth Constrained Pseudoconvex Optimization.
    Liu J; Liao X
    IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2001-2015. PubMed ID: 34464277
    [TBL] [Abstract][Full Text] [Related]  

  • 13. [Not Available].
    Grasmair M; Haltmeier M; Scherzer O
    Appl Math Comput; 2011 Nov; 218(6):2693-2710. PubMed ID: 22345828
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Fast MPI reconstruction with non-smooth priors by stochastic optimization and data-driven splitting.
    Zdun L; Brandt C
    Phys Med Biol; 2021 Aug; 66(17):. PubMed ID: 34298534
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Neural network for nonsmooth pseudoconvex optimization with general convex constraints.
    Bian W; Ma L; Qin S; Xue X
    Neural Netw; 2018 May; 101():1-14. PubMed ID: 29471133
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization.
    Weylandt M; Nagorski J; Allen GI
    J Comput Graph Stat; 2020; 29(1):87-96. PubMed ID: 32982130
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Time Rescaling of a Primal-Dual Dynamical System with Asymptotically Vanishing Damping.
    Hulett DA; Nguyen DK
    Appl Math Optim; 2023; 88(2):27. PubMed ID: 37274932
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method.
    Doikov N; Nesterov Y
    J Optim Theory Appl; 2021; 189(1):317-339. PubMed ID: 34720181
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Bayesian Trend Filtering via Proximal Markov Chain Monte Carlo.
    Heng Q; Zhou H; Chi EC
    J Comput Graph Stat; 2023; 32(3):938-949. PubMed ID: 37822489
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems.
    Boţ RI; Csetnek ER; Nimana N
    Vietnam J Math; 2018; 46(1):53-71. PubMed ID: 32714952
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.