Abstract
In this paper, we introduce a derivative-free iterative method for finding the solutions of convex constrained nonlinear equations (CCNE) using the projection strategy. The new approach is free from gradient evaluations at each iteration. Also, the search direction generated by the proposed method satisfies the sufficient descent property, which is independent of the line search. Compared with traditional methods for solving CCNE that assumes Lipschitz continuity and monotonicity to establish the global convergence result, an advantage of our proposed method is that the global convergence result does not require the assumption of Lipschitz continuity. Moreover, the underlying operator is assumed to be pseudomonotone, which is a milder condition than monotonicity. As an applications, we solve the LASSO problem in compressed sensing. Numerical experiments illustrate the performances of our proposed algorithm and provide a comparison with related algorithms.
Original language | English |
---|---|
Pages (from-to) | 9006-9027 |
Number of pages | 22 |
Journal | Mathematical Methods in the Applied Sciences |
Volume | 46 |
Issue number | 8 |
DOIs | |
State | Published - 30 May 2023 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2023 John Wiley & Sons, Ltd.
Keywords
- derivative-free method
- iterative method
- nonlinear equations
- projection method
- pseudomonotone operator
ASJC Scopus subject areas
- General Mathematics
- General Engineering