On the computation of the step-size for the CQ-like algorithms for the split feasibility problem

DOI10.1016/j.amc.2015.04.056zbMath1410.65125OpenAlexW338448201MaRDI QIDQ1663406

Biao Qu, Na Zheng, Binghua Liu

Publication date: 21 August 2018

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

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

zbMATH Keywords

step-sizeCQ-like algorithmsthe split feasibility problem

Mathematics Subject Classification ID

Related Items (19)

A linearly convergent algorithm for sparse signal reconstruction ⋮ Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem ⋮ An algorithm for the split-feasibility problems with application to the split-equality problem ⋮ Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem ⋮ A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations ⋮ On semi-convergence of parameterized SHSS method for a class of singular complex symmetric linear systems ⋮ The split feasibility problem and its solution algorithm ⋮ Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem ⋮ Convergence analysis of a novel iteration algorithm for solving split feasibility problems ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ Strong convergence theorems for an implicit iterative algorithm for the split common fixed point problem ⋮ The conjugate gradient viscosity approximation algorithm for split generalized equilibrium and variational inequality problems ⋮ Analysis on Newton projection method for the split feasibility problem ⋮ Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators ⋮ On Euler preconditioned SHSS iterative method for a class of complex symmetric linear systems ⋮ An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings ⋮ 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 ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem

Cites Work

• A multiprojection algorithm using Bregman projections in a product space
• A new halfspace-relaxation projection method for the split feasibility problem
• 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
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computation of the step-size for the CQ-like algorithms for the split feasibility problem