BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

177 related articles for article (PubMed ID: 29104405)

  • 1. A primal-dual algorithm framework for convex saddle-point optimization.
    Zhang B; Zhu Z
    J Inequal Appl; 2017; 2017(1):267. PubMed ID: 29104405
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Distributed Primal-Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms.
    Deming Yuan ; Shengyuan Xu ; Huanyu Zhao
    IEEE Trans Syst Man Cybern B Cybern; 2011 Dec; 41(6):1715-24. PubMed ID: 21824853
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Primal-dual interior point QP-free algorithm for nonlinear constrained optimization.
    Jian J; Zeng H; Ma G; Zhu Z
    J Inequal Appl; 2017; 2017(1):239. PubMed ID: 29033531
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming.
    Liu J; Duan Y; Sun M
    J Inequal Appl; 2017; 2017(1):129. PubMed ID: 28680232
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 8. On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization.
    Banjac G; Lygeros J
    Optim Lett; 2021; 15(8):2719-2732. PubMed ID: 34721701
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Inexact Primal-Dual Algorithm for DMPC With Coupled Constraints Using Contraction Theory.
    Su Y; Shi Y; Sun C
    IEEE Trans Cybern; 2022 Nov; 52(11):12525-12537. PubMed ID: 34133304
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Robust Multicategory Support Matrix Machines.
    Qian C; Tran-Dinh Q; Fu S; Zou C; Liu Y
    Math Program; 2019 Jul; 176(1-2):429-463. PubMed ID: 31983775
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 13. Primal-dual convex optimization in large deformation diffeomorphic metric mapping: LDDMM meets robust regularizers.
    Hernandez M
    Phys Med Biol; 2017 Nov; 62(23):9067-9098. PubMed ID: 28994666
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Multi-class DTI Segmentation: A Convex Approach.
    Xie Y; Chen T; Ho J; Vemuri BC
    Med Image Comput Comput Assist Interv; 2012 Oct; 2012():115-123. PubMed ID: 25177735
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Decentralized Primal-Dual Proximal Operator Algorithm for Constrained Nonsmooth Composite Optimization Problems over Networks.
    Feng L; Ran L; Meng G; Tang J; Ding W; Li H
    Entropy (Basel); 2022 Sep; 24(9):. PubMed ID: 36141164
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Novel projection neurodynamic approaches for constrained convex optimization.
    Zhao Y; Liao X; He X
    Neural Netw; 2022 Jun; 150():336-349. PubMed ID: 35344705
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Projected Primal-Dual Dynamics for Distributed Constrained Nonsmooth Convex Optimization.
    Zhu Y; Yu W; Wen G; Chen G
    IEEE Trans Cybern; 2020 Apr; 50(4):1776-1782. PubMed ID: 30530351
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A general double-proximal gradient algorithm for d.c. programming.
    Banert S; Boț RI
    Math Program; 2019; 178(1):301-326. PubMed ID: 31762494
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.