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

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

Authors Yazheng Dang, Zhonghui Xue, Bo Wang 

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

zbMATH Keywords

convergenceprojection algorithmArmijo-type line-search techniquesplit feasible problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

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

Cites work

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

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)