A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping

Many problems to appear in signal processing have been formulated as the variational inequality problem over the fixed point set of a nonexpansive mapping. In particular, convex optimization problems over the fixed point set are discussed, and operators which are considered to the problems satisfy the monotonicity. Hence, the uniqueness of the solution of the problem is not always guaranteed. In this article, we present the variational inequality problem for a monotone, hemicontinuous operator over the fixed point set of a firmly nonexpansive mapping. The main aim of the article is to solve the proposed problem by using an iterative algorithm. To this goal, we present a new iterative algorithm for the proposed problem and its convergence analysis. Numerical examples for the proposed algorithm for convex optimization problems over the fixed point set are provided in the final section.

[1]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[2]  Isao Yamada,et al.  A subgradient-type method for the equilibrium problem over the fixed point set and its applications , 2009 .

[3]  Paul-Emile Maingé,et al.  Strong convergence of an iterative method for hierarchical fixed point problems , 2007 .

[4]  Fengshan Liu,et al.  Regularization of Nonlinear Ill-Posed Variational Inequalities and Convergence Rates , 1998 .

[5]  Patrice Marcotte,et al.  Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities , 1996, SIAM J. Optim..

[6]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[7]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[8]  Yongyi Yang,et al.  Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics , 1998 .

[9]  F. Browder,et al.  Construction of fixed points of nonlinear mappings in Hilbert space , 1967 .

[10]  J. Dunn,et al.  Convexity, monotonicity, and gradient processes in Hilbert space , 1976 .

[11]  Abdellatif Moudafi,et al.  Krasnoselski–Mann iteration for hierarchical fixed-point problems , 2007 .

[12]  Philip Wolfe,et al.  Finding the nearest point in A polytope , 1976, Math. Program..

[13]  George L Allen,et al.  Variational inequalities, complementarity problems, and duality theorems , 1977 .

[14]  Wataru Takahashi,et al.  APPROXIMATION OF SOLUTIONS OF VARIATIONAL INEQUALITIES FOR MONOTONE MAPPINGS , 2004 .

[15]  N. Lloyd.  TOPICS IN METRIC FIXED POINT THEORY (Cambridge Studies in Advanced Mathematics 28) , 1992 .

[16]  S. Hirstoaga.  Iterative selection methods for common fixed point problems , 2006 .

[17]  S. Reich,et al.  Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings , 1984 .

[18]  F. Browder.  Nonlinear functional analysis , 1970 .

[19]  I. Yamada.  The Hybrid Steepest Descent Method for the Variational Inequality Problem over the Intersection of Fixed Point Sets of Nonexpansive Mappings , 2001 .

[20]  I. Yamada,et al.  Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings , 2005 .

[21]  H. Iiduka.  Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of a Nonexpansive Mapping , 2009 .

[22]  Heinz H. Bauschke.  The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert Space , 1996 .

[23]  W. A. Kirk,et al.  Topics in Metric Fixed Point Theory , 1990 .

[24]  S Rich.  SOME PROBLEMS AND RESULTS IN FIXED POINT THEORY , 1983 .

[25]  Wataru Takahashi,et al.  Weak Convergence Theorems for Nonexpansive Mappings and Monotone Mappings , 2003 .

[26]  Heinz H. Bauschke,et al.  The method of cyclic projections for closed convex sets in Hilbert space , 1997 .

[27]  Z. Opial.  Weak convergence of the sequence of successive approximations for nonexpansive mappings , 1967 .

[28]  Patrice Marcotte,et al.  New classes of generalized monotonicity , 1995 .

[29]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[30]  Patrick L. Combettes,et al.  A block-iterative surrogate constraint splitting method for quadratic signal recovery , 2003, IEEE Trans. Signal Process..

[31]  E. Zeidler.  Nonlinear Functional Analysis and its Applications: III: Variational Methods and Optimization , 1984 .

[32]  Isao Yamada,et al.  A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping , 2008, SIAM J. Optim..