Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators

REFERENCES

• H. H. Bauschke ( 1996 ). The approximation of fixed points of composition of nonexpansive mapping in Hilbert space . J. Math. Anal. Appl. 202 : 150 – 159 .
   Web of Science ®Google Scholar
• H. H. Bauschke and J. Borwein ( 1996 ). On projection algorithms for solving convex feasibility problems . SIAM Review 38 : 367 – 426 .
   Web of Science ®Google Scholar
• H. H. Bauschke and P. L. Combettes ( 2001 ). A weak to strong convergence principle for Fejér-monotone methods in Hilbert spaces . Mathematics of Operation Research 26 : 248 – 264 .
   Web of Science ®Google Scholar
• A. Cegielski ( 2007 ). A generalization of the Opial's Theorem . Control and Cybernetics 36 : 601 – 610 .
   Web of Science ®Google Scholar
• A. Cegielski ( 2010 ). Generalized relaxations of nonexpansive operators and convex feasibility problems . Contemporary Mathematics 513 : 111 – 123 .
   Google Scholar
• A. Cegielski ( 2012 ). Iterative Methods for Fixed Point Problems in Hilbert Spaces . Lecture Notes in Mathematics , Vol. 2057 . Springer , Heidelberg .
   Google Scholar
• A. Cegielski and Y. Censor ( 2011 ). Opial-type theorems and the common fixed point problems . In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering (H. H. Bauschke , R. S. Burachik , P. L. Combettes , V. Elser , D. R. Luke and H. Wolkowicz , eds.). Springer-Verlag , New York , pp. 153 – 183 .
   Google Scholar
• A. Cegielski and R. Zalas. (to be prepared). Properties of a class of approximately shrinking operators and their applications.
   Google Scholar
• Y. Censor and A. Segal ( 2009 ). The split common fixed point problem for directed operators . Journal of Convex Analysis 16 : 587 – 600 .
   Web of Science ®Google Scholar
• Ch. Chidume ( 2009 ). Geometric Properties of Banach Spaces and Nonlinear Iterations . Lecture Notes in Mathematics , Vol. 1965 . Springer , New York .
   Google Scholar
• P. L. Combettes ( 2001 ). Quasi-Fejérian analysis of some optimization algorithms . In: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (D. Butnariu , Y. Censor and S. Reich , eds.). Elsevier , Amsterdam , pp. 115 – 152 .
   Google Scholar
• F. Deutsch ( 2001 ). Best Approximation in Inner Product Spaces . Springer-Verlag , New York .
   Google Scholar
• F. Deutsch and I. Yamada ( 1998 ). Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings . Numer. Funct. Anal. Optim. 19 : 33 – 56 .
   Web of Science ®Google Scholar
• I. Ekeland and R. Témam ( 1976 ). Convex Analysis and Variational Problems . North-Holland , Amsterdam .
   Google Scholar
• K. Goebel and W. A. Kirk ( 1990 ). Topics in Metric Fixed Point Theory . Cambridge University Press , Cambridge , UK .
   Google Scholar
• K. Goebel and S. Reich ( 1984 ). Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings . Marcel Dekker , New York .
   Google Scholar
• A. A. Goldstein ( 1964 ). Convex programming in Hilbert space . Bull. Am. Math. Soc. 70 : 709 – 710 .
   Web of Science ®Google Scholar
• L. G. Gurin , B. T. Polyak , and E. V. Raik ( 1967 ). The method of projection for finding the common point in convex sets . Zh. Vychisl. Mat. i Mat. Fiz. 7:1211–1228 (in Russian). English translation in USSR Comput. Math. Phys. 7 : 1 – 24 .
   Google Scholar
• B. Halpern ( 1967 ). Fixed points of nonexpanding maps . Bull. Amer. Math. Soc. 73 : 957 – 961 .
   Web of Science ®Google Scholar
• S. A. Hirstoaga ( 2006 ). Iterative selection methods for common fixed point problems . J. Math. Anal. Appl. 324 : 1020 – 1035 .
   Web of Science ®Google Scholar
• A. Lent and Y. Censor (1980). Extensions of Hildreth's row-action method for quadratic programming. SIAM J. Control and Optimization 18:444–454.
   Web of Science ®Google Scholar
• P.-L. Lions ( 1977 ). Approximation de points fixes de contractions . C. R. Acad. Sci. Paris Sér. A 284 : 1357 – 1359 .
   Google Scholar
• P. E. Mainge ( 2008 ). Extension of the hybrid steepest descent method to a class of variational inequalities and fixed point problems with nonself-mappings . Numer. Funct. Anal. Optim. 29 : 820 – 834 .
   Web of Science ®Google Scholar
• N. Ogura and I. Yamada ( 2002 ). Non-strictly convex minimization over the fixed point set of an asymptotically shrinking nonexpansive mapping . Numer. Funct. Anal. Optimiz. 23 : 113 – 137 .
   Web of Science ®Google Scholar
• N. Ogura and I. Yamada ( 2003 ). Nonstrictly convex minimization over the bounded fixed point set of a nonexpansive mapping . Numer. Funct. Anal. Optim. 24 : 129 – 135 .
   Web of Science ®Google Scholar
• Z. Opial ( 1967 ). Weak convergence of the sequence of successive approximations for nonexpansive mappings . Bull. Amer. Math. Soc. 73 : 591 – 597 .
   Web of Science ®Google Scholar
• D. Schott ( 1991 ). A general iterative scheme with applications to convex optimization and related fields . Optimization 22 : 885 – 902 .
   Google Scholar
• T. Suzuki ( 2007 ). Some notes on Bauschke's condition . Nonlinear Analysis 67 : 2224 – 2231
   Web of Science ®Google Scholar
• R. Wittmann ( 1992 ). Approximation of fixed points of nonexpansive mappings . Arch. Math. 58 : 486 – 491 .
   Web of Science ®Google Scholar
• H.-K. Xu ( 2002 ). Iterative algorithms for nonlinear operators . J. London Math. Soc. 66 : 240 – 256 .
   Web of Science ®Google Scholar
• I. Yamada ( 2001 ). The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings . In: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (D. Butnariu , Y. Censor and S. Reich , eds.). Elsevier , Amsterdam , pp. 473 – 504 .
   Google Scholar
• I. Yamada and N. Ogura ( 2004 ). Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings . Numer. Funct. Anal. Optimiz. 25 : 619 – 655 .
   Web of Science ®Google Scholar
• I. Yamada , N. Ogura , and N. Shirakawa ( 2002 ). A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems . In: Inverse Problems, Image Analysis and Medical Imaging ( Z. Nashed and O. Scherzer , eds.). Contemporary Mathematics 313 : 269 – 305 .
   Google Scholar
• E. H. Zarantonello ( 1971 ). Projections on convex sets in Hilbert space and spectral theory . In: Contributions to Nonlinear Functional Analysis (E. H. Zarantonello , ed.). Academic Press , New York , pp. 237 – 424 .
   Google Scholar
• E. Zeidler ( 1985 ). Nonlinear Functional Analysis and Its Applications, III–Variational Methods and Optimization . Springer-Verlag , New York .
   Google Scholar