Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem

DOI10.1155/2012/958040zbMath1263.90057OpenAlexW2136510970WikidataQ58697174 ScholiaQ58697174MaRDI QIDQ1938343

Yanyan Li

Publication date: 4 February 2013

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/958040

zbMATH Keywords

multiple-set split feasibility problemrelaxed self-adaptive projection methodself-adaptive projection method

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (4)

Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size ⋮ A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem ⋮ A new convergence theorem of a projection algorithm with variable steps for variational inequalities ⋮ Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces

Cites Work

• Unnamed Item
• A multiprojection algorithm using Bregman projections in a product space
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• Convex Analysis
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem