Note on the modified relaxation CQ algorithm for the split feasibility problem

DOI10.1007/s11590-017-1148-3zbMath1423.90179OpenAlexW2608612854MaRDI QIDQ1653279

Yu-Chao Tang, Aviv Gibali, Li-Wei Liu

Publication date: 3 August 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1148-3

zbMATH Keywords

split feasibility problemArmijo-line search

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Related Items (33)

Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ Linear approximation method for solving split inverse problems and its applications ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ Several inertial methods for solving split convex feasibilities and related problems ⋮ A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces ⋮ Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications ⋮ An alternated inertial general splitting method with linearization for the split feasibility problem ⋮ Two inertial-type algorithms for solving the split feasibility problem ⋮ Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces ⋮ Alternated inertial algorithms for split feasibility problems ⋮ A new modified extragradient method with line-search process for solving pseudomonotone variational inequality in Hilbert spaces ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ A fixed point method for solving a split feasibility problem in Hilbert spaces ⋮ Unnamed Item ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ General splitting methods with linearization for the split feasibility problem ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ New self-adaptive step size algorithms for solving split variational inclusion problems and its applications ⋮ An inertial extrapolation method for solving generalized split feasibility problems in real Hilbert spaces ⋮ New inertial relaxed method for solving split feasibilities ⋮ Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery ⋮ The iterative method for solving the proximal split feasibility problem with an application to LASSO problem ⋮ A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ Convergence analysis of a new iterative algorithm for solving split variational inclusion problems ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets ⋮ An iterative viscosity approximation method for the split common fixed-point problem

Uses Software

• PDCO
• SPGL1
• FASTA

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
• On the existence of minimizers of proximity functions for split feasibility problems
• The relaxed inexact projection methods for the split feasibility problem
• Algorithms for the split variational inequality problem
• An iterative row-action method for interval convex programming
• A multiprojection algorithm using Bregman projections in a product space
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems
• A relaxed projection method for variational inequalities
• Monotone Operators and the Proximal Point Algorithm
• Atomic Decomposition by Basis Pursuit
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The Split Common Null Point Problem
• The relaxed CQ algorithm solving the split feasibility problem
• Convex programming in Hilbert space
• A note on the CQ algorithm for the split feasibility problem
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Note on the modified relaxation CQ algorithm for the split feasibility problem