A New Class of Dai-Liao Method for Solving Iteration Problems

One of the key elements of conjugate gradient algorithms is the conjugate gradient directions. In this work, we used the modified secant equation to construct a new conjugate gradient coefficient. The global convergence and fundamental descent qualities of the derived algorithm set it apart and guarantee reliable performance in a variety of settings. Numerous numerical experiments on unconstrained optimisation issues have shown that the new formulae perform noticeably better than the current approaches. The performance of the suggested conjugate gradient scheme is specifically better than that of the conventional Hestenes-Stiefel (HS) conjugate gradient approach. The computing efficiency of unconstrained optimisation problems is improved by this development.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/ichora65333.2025.11017075
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Class of Dai-Liao Method for Solving Iteration Problems

Basim A. Hassan, Mohammed Moussa
Matrix Theory and Algorithms
article

A New Class of Dai-Liao Method for Solving Iteration Problems

Basim A. Hassan, Mohammed Moussa
article en

Abstract

One of the key elements of conjugate gradient algorithms is the conjugate gradient directions. In this work, we used the modified secant equation to construct a new conjugate gradient coefficient. The global convergence and fundamental descent qualities of the derived algorithm set it apart and guarantee reliable performance in a variety of settings. Numerous numerical experiments on unconstrained optimisation issues have shown that the new formulae perform noticeably better than the current approaches. The performance of the suggested conjugate gradient scheme is specifically better than that of the conventional Hestenes-Stiefel (HS) conjugate gradient approach. The computing efficiency of unconstrained optimisation problems is improved by this development.

University of Mosul (IQ)
Climate action
Openalex Percentile: Top 86%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A New Class of Dai-Liao Method for Solving Iteration Problems — Basim A. Hassan, Mohammed Moussa · (2025) | TGRS Research Map | TGRS