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 *

135 related articles for article (PubMed ID: 24634545)

  • 1. MM Algorithms for Geometric and Signomial Programming.
    Lange K; Zhou H
    Math Program; 2014 Feb; 143(1-2):339-356. PubMed ID: 24634545
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method.
    Lan Y; Li C; Ren H; Zhang Y; Min Z
    Phys Med Biol; 2012 Oct; 57(20):6407-28. PubMed ID: 22996086
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A Penalty Strategy Combined Varying-Parameter Recurrent Neural Network for Solving Time-Varying Multi-Type Constrained Quadratic Programming Problems.
    Zhang Z; Yang S; Zheng L
    IEEE Trans Neural Netw Learn Syst; 2021 Jul; 32(7):2993-3004. PubMed ID: 32726282
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. An accelerated proximal gradient algorithm for singly linearly constrained quadratic programs with box constraints.
    Han C; Li M; Zhao T; Guo T
    ScientificWorldJournal; 2013; 2013():246596. PubMed ID: 24223028
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. A Path Algorithm for Constrained Estimation.
    Zhou H; Lange K
    J Comput Graph Stat; 2013; 22(2):261-283. PubMed ID: 24039382
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Path Following in the Exact Penalty Method of Convex Programming.
    Zhou H; Lange K
    Comput Optim Appl; 2015 Jul; 61(3):609-634. PubMed ID: 26366044
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Two Fast Complex-Valued Algorithms for Solving Complex Quadratic Programming Problems.
    Zhang S; Xia Y
    IEEE Trans Cybern; 2016 Dec; 46(12):2837-2847. PubMed ID: 26685276
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Inner approximation algorithm for generalized linear multiplicative programming problems.
    Zhao Y; Yang J
    J Inequal Appl; 2018; 2018(1):354. PubMed ID: 30839907
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Multiplicative updates for nonnegative quadratic programming.
    Sha F; Lin Y; Saul LK; Lee DD
    Neural Comput; 2007 Aug; 19(8):2004-31. PubMed ID: 17571937
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem.
    Dang C; Liang J; Yang Y
    Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Constrained optimization of L-lysine production based on metabolic flux using a mathematical programming method.
    Tada K; Kishimoto M; Omasa T; Katakura Y; Suga K
    J Biosci Bioeng; 2001; 91(4):344-51. PubMed ID: 16233002
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A Projection Neural Network for Constrained Quadratic Minimax Optimization.
    Liu Q; Wang J
    IEEE Trans Neural Netw Learn Syst; 2015 Nov; 26(11):2891-900. PubMed ID: 25966485
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A new gradient-based neural network for solving linear and quadratic programming problems.
    Leung Y; Chen KZ; Jiao YC; Gao XB; Leung KS
    IEEE Trans Neural Netw; 2001; 12(5):1074-83. PubMed ID: 18249935
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Distance majorization and its applications.
    Chi EC; Zhou H; Lange K
    Math Program; 2014 Aug; 146():409-436. PubMed ID: 25392563
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization.
    Li X; Zhao X; Duan X; Wang X
    PLoS One; 2015; 10(9):e0137166. PubMed ID: 26381742
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Partial Exactness for the Penalty Function of Biconvex Programming.
    Jiang M; Meng Z; Shen R
    Entropy (Basel); 2021 Jan; 23(2):. PubMed ID: 33494147
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Convergence of neural networks for programming problems via a nonsmooth Lojasiewicz inequality.
    Forti M; Nistri P; Quincampoix M
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1471-86. PubMed ID: 17131662
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A simple SQP algorithm for constrained finite minimax problems.
    Wang L; Luo Z
    ScientificWorldJournal; 2014; 2014():159754. PubMed ID: 24683318
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.