Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
From MaRDI portal
Publication:1949275
DOI10.1007/s10107-012-0541-zzbMath1297.90118MaRDI QIDQ1949275
Elizabeth W. Karas, Clóvis C. Gonzaga
Publication date: 6 May 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0541-z
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C25: Convex programming
Related Items
Hardy-type results on the average of the lattice point error term over long intervals, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, An adaptive accelerated first-order method for convex optimization, OSGA: a fast subgradient algorithm with optimal complexity, A Barzilai-Borwein type method for minimizing composite functions, An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix, Optimal subgradient algorithms for large-scale convex optimization in simple domains, Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\), Performance of first-order methods for smooth convex minimization: a novel approach, Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity, Optimal subgradient methods: computational properties for large-scale linear inverse problems, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, A secant-based Nesterov method for convex functions, An optimal subgradient algorithm with subspace search for costly convex optimization problems, Empirical risk minimization: probabilistic complexity and stepsize strategy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Smoothing technique and its applications in semidefinite optimization
- Introductory lectures on convex optimization. A basic course.
- Cubic regularization of Newton method and its global performance
- Improved Algorithms for Convex Minimization in Relative Scale
- Numerical Optimization
- Line search algorithms with guaranteed sufficient decrease
