Maldar, Samet2021-11-092021-11-092022https:/dx.doi.org/10.1007/s12190-021-01593-yhttps://hdl.handle.net/20.500.12451/8612In this paper, we present some convergence results for various iterative algorithms built from Hardy-Rogers type generalized nonexpansive mappings and monotone operators in Hilbert spaces. We obtain some comparison results for the rates of convergence of these algorithms to the solution of variational inequality problem including Hardy-Rogers type generalized nonexpansive mappings and monotone operators. A numerical example is given to validate these results. We apply the iterative algorithms handled herein to solve convex minimization problem and illustrate this result by providing a non-trivial numerical example.eninfo:eu-repo/semantics/embargoedAccessFixed PointVariational InequalityMonotone OperatorsGeneralized Nonexpansive MappingsConvex Minimization ProblemArticle----10.1007/s12190-021-01593-yQ1WOS:000673871100001Q1