Extragradient Methods and Linesearch Algorithms for Solving Ky Fan Inequalities and Fixed Point Problems

Extragradient Methods and Linesearch Algorithms for Solving Ky Fan Inequalities and Fixed Point Problems

0.00 Avg rating0 Votes
Article ID: iaor20127262
Volume: 155
Issue: 2
Start Page Number: 605
End Page Number: 627
Publication Date: Nov 2012
Journal: Journal of Optimization Theory and Applications
Authors: , ,
Keywords: line search, extragradient, Ky Fan inequality
Abstract:

In this paper, we introduce some new iterative methods for finding a common element of the set of points satisfying a Ky Fan inequality, and the set of fixed points of a contraction mapping in a Hilbert space. The strong convergence of the iterates generated by each method is obtained thanks to a hybrid projection method, under the assumptions that the fixed‐point mapping is a ξ‐strict pseudocontraction, and the function associated with the Ky Fan inequality is pseudomonotone and weakly continuous. A Lipschitz‐type condition is assumed to hold on this function when the basic iteration comes from the extragradient method. This assumption is unnecessary when an Armijo backtracking linesearch is incorporated in the extragradient method. The particular case of variational inequality problems is examined in a last section.

Reviews

Required fields are marked *. Your email address will not be published.