The relaxed inexact projection methods for the split feasibility problem
From MaRDI portal
Publication:628879
DOI10.1016/J.AMC.2010.11.058zbMATH Open1208.65088OpenAlexW1964066060MaRDI QIDQ628879FDOQ628879
Authors: Zhongwen Wang, Qingzhi Yang, Yuning 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
Recommendations
- A novel relaxed projective method for split feasibility problems
- A splitting-relaxed projection method for solving the split feasibility problem
- Modified halfspace-relaxation projection methods for solving the split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
global convergencenumerical experimentprojection methodsplit feasibility problemrelaxed algorithminexact technology
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- A multiprojection algorithm using Bregman projections in a product space
- Iterative oblique projection onto convex sets and the split feasibility problem
- Iterative projection onto convex sets using multiple Bregman distances
- Mathematical methods in image reconstruction
- On variable-step relaxed projection algorithm for variational inequalities
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Two-Metric Projection Methods for Constrained Optimization
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Inexact Newton Methods
- Inexact implicit methods for monotone general variational inequalities
- Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
- Title not available (Why is that?)
- On the convergence of a class of outer approximation algorithms for convex programs
- Inexact Newton methods for the nonlinear complementarity problem
- Title not available (Why is that?)
Cited In (34)
- Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators
- Semidefinite relaxation algorithm for solving tensor split feasibility problem
- Analysis on Newton projection method for the split feasibility problem
- An explicit method for the split feasibility problem with self-adaptive step sizes
- Regularized methods for the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Superimposed algorithms for the split equilibrium problems and fixed point problems
- An iterative viscosity approximation method for the split common fixed-point problem
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- General splitting methods with linearization for the split feasibility problem
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Modified halfspace-relaxation projection methods for solving the split feasibility problem
- Double projection algorithms for solving the split feasibility problems
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Strong convergence of a self-adaptive method for the split feasibility problem
- New Bregman projection algorithms for solving the split feasibility problem
- The common solutions of the split feasibility problems and fixed point problems
- Two iterative algorithms for solving the split common fixed point problems
- A new halfspace-relaxation projection method for the split feasibility problem
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- A new relaxed method for the split feasibility problem in Hilbert spaces
- A strongly convergent method for the split feasibility problem
- A relaxed projection method for split variational inequalities
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
- Preconditioning methods for solving a general split feasibility problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
- Title not available (Why is that?)
- Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
This page was built for publication: The relaxed inexact projection methods for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628879)
