Hybridization of accelerated gradient descent method
type: Item
instance of: scholarly article
title: Hybridization of accelerated gradient descent method
zbMATH Open document ID: 1464.65057
author: Dejan Ilić
author: Milena J. Petrović
author: Vladimir Rakočević
author: Nataša Z. Kontrec
author: Stefan R. Panić
published in: Numerical Algorithms
publication date: 2018-10-29T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 6967410
zbMATH Keywords: line search
zbMATH Keywords: gradient descent methods
zbMATH Keywords: Newton method
zbMATH Keywords: convergence rate
MaRDI profile type: Publication
full work available at URL: s11075-017-0460-4
OpenAlex ID: W2781207057
cites work: An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
cites work: Q3539529
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: Function minimization by conjugate gradients
cites work: On Steepest Descent
cites work: Fixed Points by a New Iteration Method
cites work: A Picard-Mann hybrid iterative process
cites work: Q3908413
cites work: Linear and nonlinear programming.
cites work: Mean Value Methods in Iteration
cites work: Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
cites work: Q5652137
cites work: An accelerated double step size model in unconstrained optimization
cites work: Accelerated double direction method for solving unconstrained optimization problems
cites work: A transformation of accelerated double step size method for unconstrained optimization
cites work: Efficent line search algorithm for unconstrained optimization
cites work: Q4107408
cites work: Q4235027
cites work: Convergence of line search methods for unconstrained optimization
cites work: Accelerated gradient descent methods with line search
cites work: Optimization theory and methods. Nonlinear programming
cites work: Convergence Conditions for Ascent Methods
cites work: Q3149262
DOI: 10.1007/S11075-017-0460-4
description: scientific article; zbMATH DE number 6967410