Hybrid CQ projection algorithm with line-search process for the split feasibility problem

DOI10.1186/S13660-016-1039-7zbMATH Open1343.65065OpenAlexW2324939644WikidataQ59467871 ScholiaQ59467871MaRDI QIDQ267698FDOQ267698

Zhonghui Xue, Bo Wang, Yazheng Dang

Publication date: 11 April 2016

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

Full work available at URL: https://doi.org/10.1186/s13660-016-1039-7

Recommendations

• New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
• A new algorithm for the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• A modified algorithm for solving the split feasibility problem
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem

zbMATH Keywords

convergenceprojection algorithmArmijo-type line-search techniquesplit feasible problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

• A multiprojection algorithm using Bregman projections in a product space
• 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
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
• Variable KM-like algorithms for fixed point problems and split feasibility problems
• Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
• Strong convergence of the CQ method for fixed point iteration processes
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• Strong Convergence of a Proximal-Type Algorithm in a Banach Space
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• The relaxed CQ algorithm solving the split feasibility problem
• Split Feasibility and Fixed Point Problems
• A note on the CQ algorithm for the split feasibility problem
• Several solution methods for the split feasibility problem
• A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
• Iterative process for solving a multiple-set split feasibility problem
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• Robust solutions of split feasibility problem with uncertain linear operator
• A new halfspace-relaxation projection method for the split feasibility problem
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities

Cited In (2)

• New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
• A Levenberg-Marquardt method for solving the tensor split feasibility problem

This page was built for publication: Hybrid CQ projection algorithm with line-search process for the split feasibility problem

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