The relaxed inexact projection methods for the split feasibility problem

DOI10.1016/j.amc.2010.11.058zbMath1208.65088OpenAlexW1964066060MaRDI QIDQ628879

Zhongwen Wang, Yuning Yang, Qingzhi Yang

Publication date: 8 March 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.058

zbMATH Keywords

global convergenceprojection methodnumerical experimentsplit feasibility problemrelaxed algorithminexact technology

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (23)

Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ Two iterative algorithms for solving the split common fixed point problems ⋮ A preconditioning method of the CQ algorithm for solving an extended split feasibility problem ⋮ Superimposed algorithms for the split equilibrium problems and fixed point problems ⋮ Preconditioning methods for solving a general split feasibility problem ⋮ Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem ⋮ Regularized methods for the split feasibility problem ⋮ An explicit method for the split feasibility problem with self-adaptive step sizes ⋮ The common solutions of the split feasibility problems and fixed point problems ⋮ New Bregman projection algorithms for solving the split feasibility problem ⋮ A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces ⋮ Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem ⋮ Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ A strongly convergent method for the split feasibility problem ⋮ Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ An iterative viscosity approximation method for the split common fixed-point problem ⋮ Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators ⋮ New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of a class of outer approximation algorithms for convex programs
• A multiprojection algorithm using Bregman projections in a product space
• On variable-step relaxed projection algorithm for variational inequalities
• Inexact implicit methods for monotone general variational inequalities
• Mathematical Methods in Image Reconstruction
• Two-Metric Projection Methods for Constrained Optimization
• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• A relaxed projection method for variational inequalities
• Inexact Newton Methods
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Iterative projection onto convex sets using multiple Bregman distances
• Inexact Newton methods for the nonlinear complementarity problem
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: The relaxed inexact projection methods for the split feasibility problem