Abstract
The conjugate gradient method (CG) is one of the most rapidly expanding and efficient ways of solving unconstrained minimization problems. Recently, there has been a lot of effort put into extending the CG approach to solve monotone nonlinear equations. In this paper, we describe a variation of the CG method for solving constrained monotone nonlinear equations. The approach has a sufficient descent property, and its global convergence has been demonstrated with the help of some reasonable assumptions. Two sets of numerical tests were run to demonstrate the proposed method's superior performance when compared to other methods. The initial experiment aimed to solve nonlinear equations with constraints, while in the second experiment, the method was applied to sparse signal reconstruction.
Original language | English |
---|---|
Pages (from-to) | 2561-2584 |
Number of pages | 24 |
Journal | RAIRO - Operations Research |
Volume | 57 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 Sept 2023 |
Externally published | Yes |
Keywords
- Convex constraint
- Global convergence
- Non-linear equations
- Projection map
- Signal processing