Abstract
In this article, inspired by the projection technique of Solodov and Svaiter, we exploit the simple structure, low memory requirement, and good convergence properties of the mixed conjugate gradient method of Stanimirović et al. [New hybrid conjugate gradient and broyden-fletcher-goldfarbshanno conjugate gradient methods, J. Optim. Theory Appl. 178 (2018), no. 3, 860-884] for unconstrained optimization problems to solve convex constrained monotone nonlinear equations. The proposed method does not require Jacobian information. Under monotonicity and Lipschitz continuity assumptions, the global convergence properties of the proposed method are established. Computational experiments indicate that the proposed method is computationally efficient. Furthermore, the proposed method is applied to solve the ℓ 1-norm regularized problems to decode sparse signals and images in compressive sensing.
| Original language | English |
|---|---|
| Pages (from-to) | 978-1013 |
| Number of pages | 36 |
| Journal | Demonstratio Mathematica |
| Volume | 55 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2022 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2022 the author(s), published by De Gruyter.
Keywords
- compressive sensing
- conjugate gradient method
- nonlinear equations
- projection method
- unconstrained optimization
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'A Dai-Liao-type projection method for monotone nonlinear equations and signal processing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver