Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
type: Item
instance of: scholarly article
title: Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
zbMATH Open document ID: 1297.90118
author: Elizabeth W. Karas
author: C. C. Gonzaga
published in: Mathematical Programming. Series A. Series B
publication date: 2013-05-06T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6160905
zbMATH Keywords: unconstrained convex problems
zbMATH Keywords: optimal method
MaRDI profile type: Publication
full work available at URL: s10107-012-0541-z
OpenAlex ID: W2134410028
cites work: Q4830373
cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
cites work: Line search algorithms with guaranteed sufficient decrease
cites work: Q3967358
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smooth minimization of non-smooth functions
cites work: Smoothing technique and its applications in semidefinite optimization
cites work: Cubic regularization of Newton method and its global performance
cites work: Numerical Optimization
cites work: Q3491338
cites work: Improved Algorithms for Convex Minimization in Relative Scale
cites work: Q5187067
DOI: 10.1007/S10107-012-0541-Z
description: scientific article; zbMATH DE number 6160905