A Projection Framework with Conjugate Gradient Directions for Large-Scale Systems of Nonlinear Equations with Applications in Signal Processing

The conjugate gradient method of Iiduka and Narushima constructs search directions that use objective function values in addition to gradient information, making it suitable for large-scale optimization. Its application to nonlinear systems of equations, however, remains unexplored. In this paper, we adapt this construction to nonlinear equations by using residual information in place of function values and combine it with the hyperplane projection technique of Solodov and Svaiter. The resulting class of methods requires no Jacobian information or matrix storage, making it well suited to large-scale and potentially nonsmooth problems. We establish global convergence under monotonicity and Lipschitz continuity assumptions. Numerical examples, including signal recovery problems, demonstrate that the proposed method is effective, efficient and competitive with existing approaches.

Authors

Publication Details

Journal
International Journal of Computational Methods
Published
2026-11-19
DOI
https://doi.org/10.1142/s0219876226500660
Primary Topic
Iterative Methods for Nonlinear Equations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Projection Framework with Conjugate Gradient Directions for Large-Scale Systems of Nonlinear Equations with Applications in Signal Processing

Abdulkarim Hassan Ibrahim, Muner Abou Hasan
International Journal of Computational Methods
Iterative Methods for Nonlinear Equations
article

A Projection Framework with Conjugate Gradient Directions for Large-Scale Systems of Nonlinear Equations with Applications in Signal Processing

Abdulkarim Hassan Ibrahim, Muner Abou Hasan
article en

Abstract

The conjugate gradient method of Iiduka and Narushima constructs search directions that use objective function values in addition to gradient information, making it suitable for large-scale optimization. Its application to nonlinear systems of equations, however, remains unexplored. In this paper, we adapt this construction to nonlinear equations by using residual information in place of function values and combine it with the hyperplane projection technique of Solodov and Svaiter. The resulting class of methods requires no Jacobian information or matrix storage, making it well suited to large-scale and potentially nonsmooth problems. We establish global convergence under monotonicity and Lipschitz continuity assumptions. Numerical examples, including signal recovery problems, demonstrate that the proposed method is effective, efficient and competitive with existing approaches.

International Journal of Computational Methods
Iterative Methods for Nonlinear Equations
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.

Laika access coming soon