A note on a multiplicative parameters gradient method

DOI10.1016/J.AMC.2016.02.031MaRDI QIDQ1733405zbMATH OpenOpenAlexFDO

Authors Snežana S. Djordjević

Publication date 21 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2016.02.031

zbMATH Keywords

backtracking line searchgradient descent methodrandom parameter

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• Two modifications of the method of the multiplicative parameters in descent gradient methods
• Multiplicative parameters in gradient descent methods
• A new parameter of memory gradient method
• scientific article; zbMATH DE number 1154410
• scientific article; zbMATH DE number 1778080

Cites work

• A transformation of accelerated double step size method for unconstrained optimization
• Accelerated gradient descent methods with line search
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
• An unconstrained optimization test functions collection
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• Multiplicative parameters in gradient descent methods
• Optimization theory and methods. Nonlinear programming
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method
• Two modifications of the method of the multiplicative parameters in descent gradient methods
• Two-Point Step Size Gradient Methods

Cited in

(3)

• Multiplier and gradient methods
• scientific article; zbMATH DE number 1154410 (Why is no real title available?)
• Two modifications of the method of the multiplicative parameters in descent gradient methods

This page was built for publication: A note on a multiplicative parameters gradient method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733405)