Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings

DOI10.1016/j.jat.2008.03.001zbMath1155.47055OpenAlexW1979918647MaRDI QIDQ953825

Isao Yamada, Noriyuki Takahashi

Publication date: 6 November 2008

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2008.03.001

zbMATH Keywords

fixed pointvariational inequalitynonexpansive mappingHilbert spacesparallel algorithmCartesian productblock-nonexpansive mappingweighted maximum norm

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items (9)

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Unnamed Item ⋮ Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ A projected subgradient algorithm for bilevel equilibrium problems and applications ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Outer approximation methods for solving variational inequalities in Hilbert space ⋮ Selective projection methods for solving a class of variational inequalities ⋮ Parallel Algorithms for Solving a Class of Variational Inequalities over the Common Fixed Points Set of a Finite Family of Demicontractive Mappings ⋮ Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of hybrid steepest-descent methods for variational inequalities
• Hilbertian convex feasibility problem: Convergence of projection methods
• Some aspects of parallel and distributed iterative algorithms - a survey
• Iterative selection methods for common fixed point problems
• An iterative approach to quadratic optimization
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• Viscosity approximation methods for fixed-points problems
• Asymmetric variational inequality problems over product sets: Applications and iterative methods
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• Quadratic optimization of fixed points of nonexpansive mappings in hubert space
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• A block-iterative surrogate constraint splitting method for quadratic signal recovery
• Variational inequalities
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Best approximation in inner product spaces

This page was built for publication: Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings