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.001MaRDI QIDQ953825zbMATH OpenOpenAlexFDO

Authors Noriyuki Takahashi, Isao Yamada

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

parallel algorithmfixed pointnonexpansive mappingvariational inequalityHilbert spacesCartesian productblock-nonexpansive mappingweighted maximum norm

Mathematics Subject Classification ID

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

Recommendations

• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
• Hybrid algorithms for generalized variational inequalities
• An explicit parallel algorithm for variational inequalities
• A parallel iterative method for solving a class of variational inequalities in Hilbert spaces
• A hybrid steepest-descent method for variational inequalities in Hilbert spaces

Cites work

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

Cited in

(13)

• Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
• Viscosity iterative method for a split equality monotone variational inclusion problem
• Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
• An explicit parallel algorithm for variational inequalities
• A projected subgradient algorithm for bilevel equilibrium problems and applications
• Outer approximation methods for solving variational inequalities in Hilbert space
• A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
• Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations
• Fixed point optimization algorithm and its application to power control in CDMA data networks
• 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
• VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
• Viscosity approximation methods for split common fixed-point problem of directed operators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953825)