Abstract
Motivated by the projection technique, in this paper, we introduce a new method for approximating the solution of nonlinear equations with convex constraints. Under the assumption that the associated mapping is Lipchitz continuous and satisfies a weaker assumption of monotonicity, we establish the global convergence of the sequence generated by the proposed algorithm. Applications and numerical example are presented to illustrate the performance of the proposed method.
| Original language | English |
|---|---|
| Pages (from-to) | 235-260 |
| Number of pages | 26 |
| Journal | AIMS Mathematics |
| Volume | 6 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2020 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2021 the Author(s), licensee AIMS Press.
Keywords
- Compressive sensing
- Conjugate gradient method
- Convex constrained
- Nonlinear equations
- Projection method
- Unconstrained optimization
ASJC Scopus subject areas
- General Mathematics