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: 33816916)

  • 1. A new non-monotonic infeasible simplex-type algorithm for Linear Programming.
    Triantafyllidis CP; Samaras N
    PeerJ Comput Sci; 2020; 6():e265. PubMed ID: 33816916
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Lattice layout and optimizer effect analysis for generating optimal transcranial electrical stimulation (tES) montages through the metaheuristic L1L1 method.
    Galaz Prieto F; Samavaki M; Pursiainen S
    Front Hum Neurosci; 2024; 18():1201574. PubMed ID: 38487104
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A specialized primal-dual interior point method for the plastic truss layout optimization.
    Weldeyesus AG; Gondzio J
    Comput Optim Appl; 2018; 71(3):613-640. PubMed ID: 30930544
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy.
    Yang X; Zhang Y
    J Inequal Appl; 2017; 2017(1):291. PubMed ID: 29213198
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Hybrid Algorithm of Ant Colony and Benders Decomposition for Large-Scale Mixed Integer Linear Programming.
    Shan T; Qiu Z
    Comput Intell Neurosci; 2022; 2022():1634995. PubMed ID: 36093475
    [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 streamlined artificial variable free version of simplex method.
    Inayatullah S; Touheed N; Imtiaz M
    PLoS One; 2015; 10(3):e0116156. PubMed ID: 25767883
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Penalty boundary sequential convex programming algorithm for non-convex optimal control problems.
    Zhang Z; Jin G; Li J
    ISA Trans; 2018 Jan; 72():229-244. PubMed ID: 29061485
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Full Nesterov-Todd Step Infeasible Interior-point Method for Symmetric Optimization in the Wider Neighborhood of the Central Path.
    Lesaja G; Wang GQ; Oganian A
    Stat Optim Inf Comput; 2021; 9(2):250-267. PubMed ID: 34141814
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Linear Programming and Fuzzy Optimization to Substantiate Investment Decisions in Tangible Assets.
    Boloș MI; Bradea IA; Delcea C
    Entropy (Basel); 2020 Jan; 22(1):. PubMed ID: 33285896
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Interior-point methodology for 3-D PET reconstruction.
    Johnson CA; Seidel J; Sofer A
    IEEE Trans Med Imaging; 2000 Apr; 19(4):271-85. PubMed ID: 10909923
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models.
    Saa PA; Nielsen LK
    Bioinformatics; 2016 Dec; 32(24):3807-3814. PubMed ID: 27559155
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems.
    Cheng L; Feng L; Li Z
    Sci Prog; 2021; 104(3):368504211030833. PubMed ID: 34292845
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. High-dimensional normalized data profiles for testing derivative-free optimization algorithms.
    Musafer H; Tokgoz E; Mahmood A
    PeerJ Comput Sci; 2022; 8():e960. PubMed ID: 36091977
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization.
    Wu Z; Mohammadisiahroudi M; Augustino B; Yang X; Terlaky T
    Entropy (Basel); 2023 Feb; 25(2):. PubMed ID: 36832696
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization.
    Pearson JW; Gondzio J
    Numer Math (Heidelb); 2017; 137(4):959-999. PubMed ID: 29151623
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A modified simplex based direct search optimization algorithm for adaptive transversal FIR filters.
    Mohsin A; Alsmadi Y; Arshad Uppal A; Gulfam SM
    Sci Prog; 2021; 104(2):368504211025409. PubMed ID: 34120527
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Hybrid interior point training of modular neural networks.
    Szymanski PT; Lemmon M; Bett CJ
    Neural Netw; 1998 Mar; 11(2):215-34. PubMed ID: 12662833
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.