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

DOI10.1016/J.AMC.2015.04.056zbMATH Open1410.65125OpenAlexW338448201MaRDI QIDQ1663406FDOQ1663406

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

Eigenvalues, singular values, and eigenvectors (15A18) Information theory (general) (94A15)

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
• 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
• A new halfspace-relaxation projection method for the split feasibility problem
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
• Improved relaxed CQ methods for solving the split feasibility problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

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

This page was built for publication: On the computation of the step-size for the CQ-like 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 Q1663406)