Iterative process for solving a multiple-set split feasibility problem

DOI10.1186/S13660-015-0576-9MaRDI QIDQ2261981zbMATH OpenOpenAlexWikidataFDO

Authors Zhonghui Xue, Yazheng Dang

Publication date 13 March 2015

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-015-0576-9

zbMATH Keywords

convergencesubgradientmultiple-set split feasibility problemaccelerated iterative algorithm

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05)

Recommendations

• A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
• Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
• A new algorithm for the split feasibility problem
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• A new \(CQ\) method for solving split feasibility problem

Cites work

• scientific article; zbMATH DE number 5777888 (Why is no real title available?)
• scientific article; zbMATH DE number 5624813 (Why is no real title available?)
• A multiprojection algorithm using Bregman projections in a product space
• A note on the multiple-set split convex feasibility problem in Hilbert space
• A perturbed projection algorithm with inertial technique for split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Piecewise smooth Lyapunov function for a nonlinear dynamical system
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem

Cited in

(4)

• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• Hybrid CQ projection algorithm with line-search process for the split feasibility problem
• Gradient methods with selection technique for the multiple-sets split feasibility problem
• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem

This page was built for publication: Iterative process for solving a multiple-set split feasibility problem

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