Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class
The main goal of this paper is to introduce an appropriate conjugate gradient class to solve unconstrained optimization problems. The presented class enjoys the benefits of having three free parameters, its directions are descent, and it can fulfill the Dai–Liao conjugacy condition. Global convergen...
Main Authors: | Sanaz Bojari, Mahmoud Paripour |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2024-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2024/5548724 |
Similar Items
-
New Conjugate Gradient Algorithm for Solving Unconstrained Optimization Problems
by: زياد قناية, et al.
Published: (2018-10-01) -
New Conjugate Gradient Algorithm for Solving Unconstrained Optimization Problems
by: Ziad Kanaya, et al.
Published: (2018-10-01) -
The modification conjugate coefficient for conjugate gradient method to solving unconstrained optimization problems
by: Hassan Abed Ahmad, et al.
Published: (2024-01-01) -
Application of spectral conjugate gradient methods for solving unconstrained optimization problems
by: Sulaiman Mohammed Ibrahim, et al.
Published: (2020-06-01) -
A New Spectral Conjugate Gradient method for solving unconstrained Optimization problems
by: أسامة محمد طاهر ویس, et al.
Published: (2022-09-01)