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 *

127 related articles for article (PubMed ID: 35153381)

  • 1. An extension of the proximal point algorithm beyond convexity.
    Grad SM; Lara F
    J Glob Optim; 2022; 82(2):313-329. PubMed ID: 35153381
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints.
    Liu N; Wang J; Qin S
    Neural Netw; 2022 Mar; 147():1-9. PubMed ID: 34953297
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization.
    Liu J; Liao X; Dong JS; Mansoori A
    Neural Netw; 2023 Mar; 160():259-273. PubMed ID: 36709530
    [TBL] [Abstract][Full Text] [Related]  

  • 4. DC Proximal Newton for Nonconvex Optimization Problems.
    Rakotomamonjy A; Flamary R; Gasso G
    IEEE Trans Neural Netw Learn Syst; 2016 Mar; 27(3):636-47. PubMed ID: 25910256
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 7. An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function.
    Boţ RI; Csetnek ER; Sedlmayer M
    Comput Optim Appl; 2023; 86(3):925-966. PubMed ID: 37969869
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A one-layer recurrent neural network for constrained nonsmooth optimization.
    Liu Q; Wang J
    IEEE Trans Syst Man Cybern B Cybern; 2011 Oct; 41(5):1323-33. PubMed ID: 21536534
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Subgradient ellipsoid method for nonsmooth convex problems.
    Rodomanov A; Nesterov Y
    Math Program; 2023; 199(1-2):305-341. PubMed ID: 37155414
    [TBL] [Abstract][Full Text] [Related]  

  • 10. New duality results for evenly convex optimization problems.
    Fajardo MD; Grad SM; Vidal J
    Optimization; 2021; 70(9):1837-1858. PubMed ID: 34531627
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Linearithmic time sparse and convex maximum margin clustering.
    Zhang XL; Wu J
    IEEE Trans Syst Man Cybern B Cybern; 2012 Dec; 42(6):1669-92. PubMed ID: 22645273
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 14. Efficient Recovery of Low-Rank Matrix via Double Nonconvex Nonsmooth Rank Minimization.
    Zhang H; Gong C; Qian J; Zhang B; Xu C; Yang J
    IEEE Trans Neural Netw Learn Syst; 2019 Oct; 30(10):2916-2925. PubMed ID: 30892254
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Robust DC optimization and its application in medical image processing.
    Li X; Wu Z; Zhang F; Qu D
    Technol Health Care; 2021; 29(2):393-405. PubMed ID: 33427705
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm.
    Lu C; Tang J; Yan S; Lin Z
    IEEE Trans Image Process; 2016 Feb; 25(2):829-39. PubMed ID: 26841392
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Existence of common fixed point and best proximity point for generalized nonexpansive type maps in convex metric space.
    Rathee S; Dhingra K; Kumar A
    Springerplus; 2016; 5(1):1940. PubMed ID: 27882280
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.