Erturk, MuzeyyenGursoy, FaikSimsek, Necip2021-01-252021-01-2520200020-71601029-0265https://doi.org/10.1080/00207160.2020.1755430https://hdl.handle.net/11467/4483SIMSEK, Necip/0000-0003-3061-5770; Erturk, Muzeyyen/0000-0002-5328-7995WOS:000532204500001In this paper we propose an S-iterative algorithm for finding the common element of the set of solutions of the variational inequalities and the set of fixed points of nonexpansive mappings. We study the convergence criteria of the mentioned algorithm under some mild conditions. As an application, a modified algorithm is suggested to solve convex minimization problems. Numerical examples are given to validate the theoretical findings obtained herein. Our results may be considered as an improvement, refinement and complement of the previously known results.eninfo:eu-repo/semantics/closedAccessS-iterative algorithmconvergencerate of convergencevariational inequalitynonexpansive mappingsconvex optimizationArticleQ2WOS:000532204500001Q22-s2.0-8508431820810.1080/00207160.2020.1755430