New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem

DOI10.1007/S11766-023-4464-7zbMATH Open1517.47100MaRDI QIDQ6158077FDOQ6158077

Authors

Publication date 31 May 2023

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

zbMATH Keywords

convergenceprojection algorithmArmijo-type line-search techniquesplit feasible probleminertial

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• Hybrid CQ projection algorithm with line-search process for the split feasibility problem
• An inertial triple-projection algorithm for solving the split feasibility problem
• New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
• Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
• Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators

Cites Work

• A multiprojection algorithm using Bregman projections in a product space
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• 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
• An efficient iterative method for finding common fixed point and variational inequalities in Hilbert spaces
• An inertial extrapolation method for multiple-set split feasibility problem
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• Convergence analysis for proximal split feasibility problems and fixed point problems
• Global and linear convergence of alternated inertial methods for split feasibility problems
• Hybrid CQ projection algorithm with line-search process for the split feasibility problem
• Iterative methods for finding the minimum-norm solution of the standard monotone variational inequality problems with applications in Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• Robust solutions of split feasibility problem with uncertain linear operator
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Signal Recovery by Proximal Forward-Backward Splitting
• Solving the split feasibility problem without prior knowledge of matrix norms
• Some methods of speeding up the convergence of iteration methods
• Split feasibility and fixed point problems
• The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators

Cited In (2)

• An inertial triple-projection algorithm for solving the split feasibility problem
• Hybrid CQ projection algorithm with line-search process for the split feasibility problem

This page was built for publication: New hybrid inertial CQ projection algorithms 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 Q6158077)