FR-type algorithm for finding approximate solutions to nonlinear monotone operator equations

17Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper focuses on the problem of convex constraint nonlinear equations involving monotone operators in Euclidean space. A Fletcher and Reeves type derivative-free conjugate gradient method is proposed. The proposed method is designed to ensure the descent property of the search direction at each iteration. Furthermore, the convergence of the proposed method is proved under the assumption that the underlying operator is monotone and Lipschitz continuous. The numerical results show that the method is efficient for the given test problems.

Cite

CITATION STYLE

APA

Abubakar, A. B., Muangchoo, K., Ibrahim, A. H., Abubakar, J., & Rano, S. A. (2021). FR-type algorithm for finding approximate solutions to nonlinear monotone operator equations. Arabian Journal of Mathematics, 10(2), 261–270. https://doi.org/10.1007/s40065-021-00313-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free