A New Conjugate Gradient Projection Method for Convex Constrained Nonlinear Equations

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...

Full description

Saved in:
Bibliographic Details
Published in:Complexity (New York, N.Y.) N.Y.), 2020, Vol.2020 (2020), p.1-14
Main Authors: Liu, Pengjie, Jiang, Xianzhen, Jian, Jinbao
Format: Article
Language:English
Subjects:
Algorithms
Conjugates
Constraints
Nonlinear equations
Projection
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:1076-2787
1099-0526
DOI:10.1155/2020/8323865