Relaxed extragradient algorithms for the split feasibility problem

DOI10.1155/2014/468079MaRDI QIDQ1714613zbMATH OpenOpenAlexWikidataFDO

Authors Youli Yu, Shin Min Kang, Young Chel Kwun

Publication date 1 February 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2014/468079

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• A new extragradient method for equilibrium, split feasibility and fixed point problems
• A novel relaxed projective method for split feasibility problems
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• A new extragradient-type algorithm for the split feasibility problem
• Relaxed inertial accelerated algorithms for solving split equality feasibility problem

Cited in

(7)

• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• A relaxed extragradient-like method for a class of constrained optimization problem
• The ball-relaxed gradient-projection algorithm for split feasibility problem
• A new extragradient-type algorithm for the split feasibility problem
• A new extragradient method for equilibrium, split feasibility and fixed point problems
• A Strong Convergence Theorem for Solving the Split Equality Fixed Point Problem
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem

This page was built for publication: Relaxed extragradient algorithms for the split feasibility problem

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