An Effective HS-CG Update: Avoiding Oscillations in Nonlinear Optimization

In this research, we introduce a modified direction update formula to improve the descent features of iterative optimization, therefore presenting a fresh approach to the Conjugate Gradient (CG) method. The proposed method adjusts the search direction at each iteration by incorporating gradient and step projections, weighted by inner products between gradient and step vectors. The modified HS-CG approach seeks to decrease the computational cost often associated with conventional approaches and speed up convergence by carefully balancing these projections. Experimental results demonstrate that our approach outperforms standard CG algorithms in achieving faster convergence on a range of benchmark problems, especially in high-dimensional spaces. This enhancement makes the method particularly promising for large-scale optimization challenges encountered in fields such as machine learning and engineering design.

Authors

Institutions

Publication Details

Journal
Tikrit Journal of Pure Science
Published
2025-04-25
DOI
https://doi.org/10.25130/tjps.v30i2.1886
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Effective HS-CG Update: Avoiding Oscillations in Nonlinear Optimization

Isam H. Halil
Tikrit Journal of Pure Science
Advanced Optimization Algorithms Research
article

An Effective HS-CG Update: Avoiding Oscillations in Nonlinear Optimization

Isam H. Halil
article en

Abstract

In this research, we introduce a modified direction update formula to improve the descent features of iterative optimization, therefore presenting a fresh approach to the Conjugate Gradient (CG) method. The proposed method adjusts the search direction at each iteration by incorporating gradient and step projections, weighted by inner products between gradient and step vectors. The modified HS-CG approach seeks to decrease the computational cost often associated with conventional approaches and speed up convergence by carefully balancing these projections. Experimental results demonstrate that our approach outperforms standard CG algorithms in achieving faster convergence on a range of benchmark problems, especially in high-dimensional spaces. This enhancement makes the method particularly promising for large-scale optimization challenges encountered in fields such as machine learning and engineering design.

Tikrit Journal of Pure ScienceVol. 30(2)
University of Kirkuk (IQ)
Openalex Percentile: Top 87%
Advanced Optimization Algorithms Research
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.