A new conjugate gradient projection method for convex constrained nonlinear equations (Q2205252)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7262627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new conjugate gradient projection method for convex constrained nonlinear equations |
scientific article; zbMATH DE number 7262627 |
Statements
A new conjugate gradient projection method for convex constrained nonlinear equations (English)
0 references
20 October 2020
0 references
Summary: The conjugate gradient projection method is one of the most effective methods for solving large-scale monotone nonlinear equations with convex constraints. In this paper, a new conjugate parameter is designed to generate the search direction, and an adaptive line search strategy is improved to yield the step size, and then, a new conjugate gradient projection method is proposed for large-scale monotone nonlinear equations with convex constraints. Under mild conditions, the proposed method is proved to be globally convergent. A large number of numerical experiments for the presented method and its comparisons are executed, which indicates that the presented method is very promising. Finally, the proposed method is applied to deal with the recovery of sparse signals.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.920956015586853
0 references
0.8969485759735107
0 references
0.8902043104171753
0 references
0.8880770802497864
0 references