Full Text: PDF
DOI: 10.23952/jnfa.2024.32
Received June 30, 2024; Accepted December 3, 2024; Published December 24, 2024
Abstract. This paper presents a spectral class of Dai-Kou-type methods for monotone systems of equations with convex constraints by exploiting the advantages of three-term conjugate gradient (TTCG) methods and the efficiency of the Dai-Kou scheme. The approach combines a modified Dai-Kou search direction with the projection method and could be best described as a nonlinear version of the Dai-Kou method. Under simple assumptions, the approach is proven to converge globally. Furthermore, several numerical experiments demonstrate that the proposed method outperforms two existing approaches for convex-constrained monotone nonlinear equations.
How to Cite this Article:
A.M. Awwal, K. Ahmed, P. Sukprasert, K. Khammahawong, A spectral class of Dai-Kou-type methods with applications to signal processing, J. Nonlinear Funct. Anal. 2024 (2024) 32.