LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Picard-type iterative algorithm for general variational inequalities and nonexpansive mappings

Photo from archive.org

In this paper, a normal S-iterative algorithm is studied and analyzed for solving a general class of variational inequalities involving a set of fixed points of nonexpansive mappings and two… Click to show full abstract

In this paper, a normal S-iterative algorithm is studied and analyzed for solving a general class of variational inequalities involving a set of fixed points of nonexpansive mappings and two nonlinear operators. It is shown that the proposed algorithm converges strongly under mild conditions. The rate of convergence of the proposed iterative algorithm is also studied. An equivalence of convergence between the normal S-iterative algorithm and Algorithm 2.6 of Noor (J. Math. Anal. Appl. 331 , 810–822, 2007 ) is established and a comparison between the two is also discussed. As an application, a modified algorithm is employed to solve convex minimization problems. Numerical examples are given to validate the theoretical findings. The results obtained herein improve and complement the corresponding results in Noor (J. Math. Anal. Appl. 331 , 810–822, 2007 ).

Keywords: type iterative; algorithm; iterative algorithm; picard type; nonexpansive mappings; variational inequalities

Journal Title: Numerical Algorithms
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.