Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization.
Andrei, Neculai (2011)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Andrei, Neculai (2011)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Zainab Hassan Ahmed, Mohamed Hbaib, Khalil K. Abbo (2024)
Applications of Mathematics
Similarity:
The Fletcher-Reeves (FR) method is widely recognized for its drawbacks, such as generating unfavorable directions and taking small steps, which can lead to subsequent poor directions and steps. To address this issue, we propose a modification to the FR method, and then we develop it into the three-term conjugate gradient method in this paper. The suggested methods, named ``HZF'' and ``THZF'', preserve the descent property of the FR method while mitigating the drawbacks. The algorithms...
Mahbube Akbari, Saeed Nezhadhosein, Aghile Heydari (2024)
Applications of Mathematics
Similarity:
We introduce a new scaling parameter for the Dai-Kou family of conjugate gradient algorithms (2013), which is one of the most numerically efficient methods for unconstrained optimization. The suggested parameter is based on eigenvalue analysis of the search direction matrix and minimizing the measure function defined by Dennis and Wolkowicz (1993). The corresponding search direction of conjugate gradient method has the sufficient descent property and the extended conjugacy condition....
Chleboun, Jan
Similarity:
Liu, Hailin, Cheng, Sui Sun, Li, Xiaoyong (2011)
Applied Mathematics E-Notes [electronic only]
Similarity:
Zhang, Ming-Liang, Xiao, Yun-Hai, Zhou, Dangzhen (2010)
Mathematical Problems in Engineering
Similarity:
Yuan, Gonglin (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity: