Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917499076870144 |
|---|---|
| author | Hamiss, Kabenge Alshahrani, Mohammed Syed, Mujahid N. |
| author_facet | Hamiss, Kabenge Alshahrani, Mohammed Syed, Mujahid N. |
| contents | We introduce two derivative-free projection methods for large-scale systems of nonlinear monotone equations subject to convex constraints. Both methods incorporate an adaptive spectral parameter into established conjugate gradient frameworks: the first generalizes the modified optimal Perry method via an eigenvalue-optimized scaling matrix, and the second generalizes the Hager--Zhang-type conjugate gradient projection method via a spectral Dai--Liao parameter. The resulting search directions satisfy a sufficient descent condition independent of the line search. For the first method, we establish global convergence under monotonicity alone, without requiring Lipschitz continuity of the mapping. For the second, global convergence holds under the standard monotonicity and Lipschitz continuity assumptions. Numerical experiments on 18 test problems across dimensions up to 120{,}000, together with applications to $\ell_1$-regularized signal recovery and regularized logistic regression, confirm the practical effectiveness of the proposed approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_15570 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity Hamiss, Kabenge Alshahrani, Mohammed Syed, Mujahid N. Optimization and Control Numerical Analysis 65H10, 65K05, 90C30, 90C56 We introduce two derivative-free projection methods for large-scale systems of nonlinear monotone equations subject to convex constraints. Both methods incorporate an adaptive spectral parameter into established conjugate gradient frameworks: the first generalizes the modified optimal Perry method via an eigenvalue-optimized scaling matrix, and the second generalizes the Hager--Zhang-type conjugate gradient projection method via a spectral Dai--Liao parameter. The resulting search directions satisfy a sufficient descent condition independent of the line search. For the first method, we establish global convergence under monotonicity alone, without requiring Lipschitz continuity of the mapping. For the second, global convergence holds under the standard monotonicity and Lipschitz continuity assumptions. Numerical experiments on 18 test problems across dimensions up to 120{,}000, together with applications to $\ell_1$-regularized signal recovery and regularized logistic regression, confirm the practical effectiveness of the proposed approach. |
| title | Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity |
| topic | Optimization and Control Numerical Analysis 65H10, 65K05, 90C30, 90C56 |
| url | https://arxiv.org/abs/2605.15570 |