A secant-based Nesterov method for convex functions
From MaRDI portal
Recommendations
- A new gradient method via least change secant update
- Adaptive restart of the optimized gradient method for convex optimization
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- Improved algorithms for convex minimization in relative scale
- scientific article; zbMATH DE number 4593
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A non-monotone line search algorithm for unconstrained optimization
- A repository of convex quadratic programming problems
- Adaptive restart for accelerated gradient schemes
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Benchmarking large-scale distributed convex quadratic programming algorithms
- Benchmarking optimization software with performance profiles.
- Fast alternating direction optimization methods
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Iteration-complexity of first-order penalty methods for convex programming
- Logistic regression, AdaBoost and Bregman distances
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On parallel complexity of nonsmooth convex optimization
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Some Algorithms for Minimizing a Function of Several Variables
- Some methods of speeding up the convergence of iteration methods
- Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method
- Surface topography using shape-from-shading
- Templates for convex cone problems with applications to sparse signal recovery
- Two-Point Step Size Gradient Methods
Cited in
(3)
This page was built for publication: A secant-based Nesterov method for convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361131)
