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 *

82 related articles for article (PubMed ID: 28092519)

  • 21. High-dimensional Cost-constrained Regression via Nonconvex Optimization.
    Yu G; Fu H; Liu Y
    Technometrics; 2022; 64(1):52-64. PubMed ID: 36312889
    [TBL] [Abstract][Full Text] [Related]  

  • 22. On the Convergence Analysis of the Optimized Gradient Method.
    Kim D; Fessler JA
    J Optim Theory Appl; 2017 Jan; 172(1):187-205. PubMed ID: 28461707
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. New Results on Superlinear Convergence of Classical Quasi-Newton Methods.
    Rodomanov A; Nesterov Y
    J Optim Theory Appl; 2021; 188(3):744-769. PubMed ID: 33746292
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Neural network for solving convex quadratic bilevel programming problems.
    He X; Li C; Huang T; Li C
    Neural Netw; 2014 Mar; 51():17-25. PubMed ID: 24333480
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. Efficient methods for estimating constrained parameters with applications to lasso logistic regression.
    Tian GL; Tang ML; Fang HB; Tan M
    Comput Stat Data Anal; 2008 Mar; 52(7):3528-3542. PubMed ID: 18443660
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Information geometric algorithm for estimating switching probabilities in space-varying HMM.
    Nascimento JC; Barão M; Marques JS; Lemos JM
    IEEE Trans Image Process; 2014 Dec; 23(12):5263-73. PubMed ID: 25330491
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Reconstruction of sparse-view X-ray computed tomography using adaptive iterative algorithms.
    Liu L; Lin W; Jin M
    Comput Biol Med; 2015 Jan; 56():97-106. PubMed ID: 25464352
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation.
    Bian W; Chen X
    IEEE Trans Neural Netw Learn Syst; 2014 Mar; 25(3):545-56. PubMed ID: 24807450
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Half-quadratic-based iterative minimization for robust sparse representation.
    He R; Zheng WS; Tan T; Sun Z
    IEEE Trans Pattern Anal Mach Intell; 2014 Feb; 36(2):261-75. PubMed ID: 24356348
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Using convex optimization of autocorrelation with constrained support and windowing for improved phase retrieval accuracy.
    Pietrini A; Nettelblad C
    Opt Express; 2018 Sep; 26(19):24422-24443. PubMed ID: 30469561
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Approximate least trimmed sum of squares fitting and applications in image analysis.
    Shen F; Shen C; van den Hengel A; Tang Z
    IEEE Trans Image Process; 2013 May; 22(5):1836-47. PubMed ID: 23314774
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Algorithms for accelerated convergence of adaptive PCA.
    Chatterjee C; Kang Z; Roychowdhury VP
    IEEE Trans Neural Netw; 2000; 11(2):338-55. PubMed ID: 18249765
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Solving large-scale general phase retrieval problems via a sequence of convex relaxations.
    Doelman R; Thao NH; Verhaegen M
    J Opt Soc Am A Opt Image Sci Vis; 2018 Aug; 35(8):1410-1419. PubMed ID: 30110278
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Robust DLPP With Nongreedy $\ell _1$ -Norm Minimization and Maximization.
    Wang Q; Gao Q; Xie D; Gao X; Wang Y
    IEEE Trans Neural Netw Learn Syst; 2018 Mar; 29(3):738-743. PubMed ID: 28055920
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Alternating direction methods for latent variable gaussian graphical model selection.
    Ma S; Xue L; Zou H
    Neural Comput; 2013 Aug; 25(8):2172-98. PubMed ID: 23607561
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Subsampled Hessian Newton Methods for Supervised Learning.
    Wang CC; Huang CH; Lin CJ
    Neural Comput; 2015 Aug; 27(8):1766-95. PubMed ID: 26079755
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Variational viewpoint of the quadratic Markov measure field models: theory and algorithms.
    Rivera M; Dalmau O
    IEEE Trans Image Process; 2012 Mar; 21(3):1246-57. PubMed ID: 21926023
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 5.