On q-variant of Dai–Yuan conjugate gradient algorithm for unconstrained optimization problems

In this paper, we propose a modified q -Dai–Yuan ( q -DY) conjugate gradient algorithm based on q -gradient for solving unconstrained optimization problems. The q -gradient is calculated based on q -derivative that requires a dilation parameter q for controlling the balance between the local and glo...

Full description

Saved in:
Bibliographic Details
Published in:Nonlinear dynamics 2021-05, Vol.104 (3), p.2471-2496
Main Authors: Mishra, Shashi Kant, Samei, Mohammad Esmael, Chakraborty, Suvra Kanti, Ram, Bhagwat
Format: Article
Language:English
Subjects:
Algorithms
Automotive Engineering
Classical Mechanics
Conjugates
Control
Dynamical Systems
Engineering
Mechanical Engineering
Optimization
Original Paper
Vibration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a modified q -Dai–Yuan ( q -DY) conjugate gradient algorithm based on q -gradient for solving unconstrained optimization problems. The q -gradient is calculated based on q -derivative that requires a dilation parameter q for controlling the balance between the local and global search. The strong global convergence of the algorithm is proved under standard Wolfe conditions, and numerical results show the efficiency of the proposed algorithm.
ISSN:0924-090X
1573-269X
DOI:10.1007/s11071-021-06378-3