The hybrid extragradient implicit approach for convex feasibility problems

zbMATH Open1487.47100MaRDI QIDQ3389128FDOQ3389128

Authors: Lan Di, George Yuan 

Publication date: 7 May 2021

Full work available at URL: http://www.yokohamapublishers.jp/online-p/JNCA/vol21/jncav21n9p1943.pdf

Recommendations

• On convex feasibility problems
• A new method for solving convex feasibility problem in Banach spaces
• scientific article; zbMATH DE number 7213713
• Splitting methods for a convex feasibility problem in Hilbert spaces
• Hilbertian convex feasibility problem: Convergence of projection methods

zbMATH Keywords

Hilbert spacenonexpansive mappingstrong convergencevariational inequalityextragradient algorithm

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40)

Cited In (2)

• The implicit convex feasibility problem and its application to adaptive image denoising
• A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method

This page was built for publication: The hybrid extragradient implicit approach for convex feasibility problems

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