The ball-relaxed gradient-projection algorithm for split feasibility problem

DOI10.1155/2022/9991466zbMATH Open1506.47109OpenAlexW4223576731MaRDI QIDQ2138186FDOQ2138186

Authors: Xiaochun Li, Fugen Gao, Xiao-Xiao Liu 

Publication date: 11 May 2022

Published in: Journal of Function Spaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2022/9991466

Recommendations

• The ball-relaxed CQ algorithms for the split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• Strongly convergent ball-relaxed CQ algorithm and its application
• The relaxed CQ algorithm solving the split feasibility problem
• Relaxed extragradient algorithms for the split feasibility problem

zbMATH Keywords

gradient-projection algorithmsplit feasibility problem: weak convergence

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Iterative procedures involving nonlinear operators (47J25) Set-valued and variational analysis (49J53)

Cites Work

• Convex analysis and monotone operator theory in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• Iterative oblique projection onto convex sets and the split feasibility problem
• A relaxed alternating CQ-algorithm for convex feasibility problems
• Convergence analysis for proximal split feasibility problems and fixed point problems
• Iterative approximation of solutions for proximal split feasibility problems
• Solving the split feasibility problem without prior knowledge of matrix norms
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Averaged mappings and the gradient-projection algorithm
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Title not available (Why is that?)
• Extra-gradient methods for solving split feasibility and fixed point problems
• New inertial relaxed method for solving split feasibilities
• Strong convergence result for proximal split feasibility problem in Hilbert spaces
• Strong convergence of two algorithms for the split feasibility problem in Banach spaces
• The ball-relaxed CQ algorithms for the split feasibility problem

Cited In (2)

• Polyak's gradient method for split feasibility problem constrained by level sets
• Strongly convergent ball-relaxed CQ algorithm and its application

This page was built for publication: The ball-relaxed gradient-projection algorithm for split feasibility problem

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