Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications

In this paper, a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations is proposed by integrating both hyperplane projection and hybrid techniques. The key features of this method are as follows: (1) It is characterized by a low storage requirement and relies solely on function values; (2) The designed search direction ensures the sufficient descent property without the need for line search approaches; (3) Under certain reasonable assumptions, the global convergence of the method is established; (4) Experimental results demonstrate that the proposed method outperforms the two existing methods about 75.71%, 85.36%, and 86.43% of benchmark problems in terms of CPU time, the number of function evaluations, and iterations. Furthermore, it is applied to successfully solve the sparse signal restoration problems.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2025-10-28
DOI
https://doi.org/10.1371/journal.pone.0335265
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

Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications

Songhua Wang, Dandan Li, Xia Yan
PLoS ONE
Advanced Optimization Algorithms Research
article

Global convergence in a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations with applications

Songhua Wang, Dandan Li, Xia Yan
article en

Abstract

In this paper, a hybrid conjugate gradient projection method for finding solutions of constrained nonlinear equations is proposed by integrating both hyperplane projection and hybrid techniques. The key features of this method are as follows: (1) It is characterized by a low storage requirement and relies solely on function values; (2) The designed search direction ensures the sufficient descent property without the need for line search approaches; (3) Under certain reasonable assumptions, the global convergence of the method is established; (4) Experimental results demonstrate that the proposed method outperforms the two existing methods about 75.71%, 85.36%, and 86.43% of benchmark problems in terms of CPU time, the number of function evaluations, and iterations. Furthermore, it is applied to successfully solve the sparse signal restoration problems.

PLoS ONEVol. 20(10)
Guangzhou Automobile Group (China) (CN), Baise University (CN)
Openalex Percentile: Top 54%
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.