A partial complement method for approximating solutions of a primal dual fixed-point problem

DOI10.1007/s11590-009-0172-3zbMath1200.90168MaRDI QIDQ1958648

Abdellatif Moudafi

Publication date: 4 October 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0172-3

zbMATH Keywords

fixed point; partial inverse; firmly nonexpansive mapping; K-M algorithm

Mathematics Subject Classification ID

90C48: Programming in abstract spaces

Related Items

Convergence theorems for equilibrium and fixed point problems, Iterative approximation of countable family of relatively nonexpansive mappings and system of equilibrium problems in Banach spaces, A new iterative scheme for a countable family of relatively nonexpansive mappings and an equilibrium problem in Banach spaces, A new hybrid projection algorithm for system of equilibrium problems and variational inequality problems and two finite families of quasi-\(\phi\)-nonexpansive mappings, Approximation of common solutions for system of equilibrium problems and fixed-point problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial inverse of a monotone operator
• Parallel proximal decomposition algorithms for robust estimation.
• A note on segmenting Mann iterates
• A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”
• A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
• A Decomposition Relative to Convex Sets
• Fixed points of nonexpanding maps
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Convex Analysis