Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces

DOI10.1186/S13660-019-2026-6MaRDI QIDQ2067802zbMATH OpenOpenAlexWikidataFDO

Authors Tingting Tian, Luoyi Shi, Rudong Chen

Publication date 19 January 2022

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-019-2026-6

zbMATH Keywords

split equality problembounded linear regularitylinear convergencerelaxed gradient projection algorithm

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Methods of reduced gradient type (90C52)

Recommendations

• Linear convergence of gradient projection algorithm for split equality problems
• A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• On the convergence of splitting proximal methods for equilibrium problems in Hilbert spaces
• Strong convergence of Halpern-type projection subgradient algorithms with linear search for split equilibrium problems
• Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
• Extragradient-proximal methods for split equilibrium and fixed point problems in Hilbert spaces
• The strongly convergent relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
• Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces

Cites work

• scientific article; zbMATH DE number 6301548 (Why is no real title available?)
• A relaxed alternating CQ-algorithm for convex feasibility problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Linear convergence of gradient projection algorithm for split equality problems
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Solving the split equality problem without prior knowledge of operator norms
• Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem
• Strong convergence of iterative algorithms for the split equality problem
• The multiple-sets split feasibility problem and its applications for inverse problems

Cited in

(6)

• Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces
• scientific article; zbMATH DE number 7544005 (Why is no real title available?)
• A new method for solving split equality problems via projection dynamical systems
• Two general splitting methods with alternated inertia for solving split equality problem in Hilbert spaces
• Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces

This page was built for publication: Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces

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