On the convergence of CQ algorithm with variable steps for the split equality problem

DOI10.1007/S11075-016-0177-9zbMATH Open1382.47035OpenAlexW2470963051MaRDI QIDQ513675FDOQ513675

Fenghui Wang

Publication date: 7 March 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0177-9

Recommendations

• New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
• Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• scientific article; zbMATH DE number 6025203
• scientific article; zbMATH DE number 7399383

zbMATH Keywords

weak convergenceHilbert spacessplit equality problemsplit feasibility problemCQ algorithmvariable step-size

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Inverse problems in optimal control (49N45) Numerical solutions to equations with nonlinear operators (65J15)

Cites Work

• A multiprojection algorithm using Bregman projections in a product space
• General method for solving the split common fixed point problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Iterative oblique projection onto convex sets and the split feasibility problem
• Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
• On variable-step relaxed projection algorithm for variational inequalities
• A relaxed alternating CQ-algorithm for convex feasibility problems
• Solving the split feasibility problem without prior knowledge of matrix norms
• Quasi-Fejérian analysis of some optimization algorithms
• Title not available (Why is that?)
• A strongly convergent algorithm for the split common fixed point problem
• A splitting-relaxed projection method for solving the split feasibility problem
• Title not available (Why is that?)

Cited In (26)

• An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps
• A self-adaptive iterative algorithm for the split common fixed point problems
• Inertial accelerated algorithms for the split common fixed-point problem of directed operators
• Title not available (Why is that?)
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings
• Iterative solutions of the split common fixed point problem for strictly pseudo-contractive mappings
• The Strongly Convergent Relaxed Alternating CQ Algorithms for the Split Equality Problem in Hilbert Spaces
• Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
• An iterative algorithm for solving split equality fixed point problems for a class of nonexpansive-type mappings in Banach spaces
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
• A new method for solving split equality problems via projection dynamical systems
• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
• A new iterative method for the split common fixed point problem in Hilbert spaces
• A new method for split common fixed-point problem without priori knowledge of operator norms
• A strong convergence theorem for a parallel iterative method for solving the split common null point problem in Hilbert spaces
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Title not available (Why is that?)
• Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
• Polyak's gradient method for split feasibility problem constrained by level sets
• Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
• An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
• Title not available (Why is that?)
• Title not available (Why is that?)
• The ball-relaxed CQ algorithms for the split feasibility problem

This page was built for publication: On the convergence of CQ algorithm with variable steps for the split equality problem

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