SIAM Journal on Optimization · 2013 · 198 citations · 63 references
ComputingComputer ScienceAlgorithmsOptimizationTheory Of ComputationAlgorithm AnalysisApproximation MethodsConvergence AnalysisConvex OptimizationGradient-based OptimizationNumerical AlgorithmsAccelerated OptimizationComplexity AnalysisConvergence Rate AnalysisGradient DescentMinimizationNesterov Accelerated GradientProximal AlgorithmsSecond-order Optimization
We propose a convergence analysis of accelerated forward-backward splitting methods for composite function minimization, when the proximity operator is not available in closed form, and can only be computed up to a certain precision. We prove that the $1/k^2$ convergence rate for the function values can be achieved if the admissible errors are of a certain type and satisfy a sufficiently fast decay condition. Our analysis is based on the machinery of estimate sequences first introduced by Nesterov for the study of accelerated gradient descent algorithms. Furthermore, we give a global complexity analysis, taking into account the cost of computing admissible approximations of the proximal point. An experimental analysis is also presented.
63
A Gene-Expression Signature as a Predictor of Survival in Breast Cancer
Marc J. van de Vijver, Yudong D. He, Laura van ‘t Veer et al. · New England Journal of Medicine · 2002 · 6.5K citations · Full text
Medicine, Bioinformatics, Oncology +17