Opial-type theorems and the common fixed point problem

DOI10.1007/978-1-4419-9569-8_9MaRDI QIDQ2897281zbMATH OpenOpenAlexFDO

Authors Andrzej Cegielski, Yair Censor

Publication date 10 July 2012

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4419-9569-8_9

zbMATH Keywords

common fixed pointquasi-nonexpansive operatorscutter operatorsdos Santos methodOpial theorem

Mathematics Subject Classification ID

Convex programming (90C25) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15)

Recommendations

• A generalization of the Opial's theorem
• Finding common fixed points of nonexpansive mappings by iteration
• Semigroup of nonexpansive mappings on a Hilbert space
• Weak and strong convergence theorems for families of nonexpansive mappings and their applications
• Common fixed points of two nonexpansive mappings in Banach spaces

Cites work

• scientific article; zbMATH DE number 447429 (Why is no real title available?)
• scientific article; zbMATH DE number 3853749 (Why is no real title available?)
• scientific article; zbMATH DE number 5777888 (Why is no real title available?)
• scientific article; zbMATH DE number 5624813 (Why is no real title available?)
• scientific article; zbMATH DE number 1382772 (Why is no real title available?)
• A Geometrical Look at Iterative Methods for Operators with Fixed Points
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• A general iterative scheme with applications to convex optimization and related fields
• A generalization of the Opial's theorem
• A linear acceleration row action method for projecting onto subspaces
• A parallel subgradient projections method for the convex feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• An interior points algorithm for the convex feasibility problem
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Block-iterative surrogate projection methods for convex feasibility problems
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• Generalized relaxations of nonexpansive operators and convex feasibility problems
• Hilbertian convex feasibility problem: Convergence of projection methods
• Iterative approximation of fixed points
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• On the string averaging method for sparse common fixed-point problems
• Quasi-Fejérian analysis of some optimization algorithms
• Relaxed outer projections, weighted averages and convex feasibility
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Several solution methods for the split feasibility problem
• The method of projections for finding the common point of convex sets
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

Cited in

(18)

• Solving split common fixed-point problem of firmly quasi-nonexpansive mappings without prior knowledge of operators norms
• Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
• Limits of eventual families of sets with application to algorithms for the common fixed point problem
• A generalized block-iterative projection method for the common fixed point problem induced by cutters
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• Weak, strong, and linear convergence of a double-layer fixed point algorithm
• Iterative methods for solving variational inequalities in Euclidean space
• Convergence in norm of projection regularized Krasnoselski-Mann iterations for fixed points of cutters
• A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
• A generalization of the Opial's theorem
• An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
• Extrapolation and local acceleration of an iterative process for common fixed point problems
• Set intersection problems: supporting hyperplanes and quadratic programming
• The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
• Viscosity approximation methods for split common fixed-point problem of directed operators

This page was built for publication: Opial-type theorems and the common fixed point problem

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