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

DOI10.1155/2022/9991466MaRDI QIDQ2138186zbMATH OpenOpenAlexFDO

Authors Xiaochun Li, Fugen Gao, Xiao-Xiao Liu

Publication date 11 May 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

gradient-projection algorithmsplit feasibility problem: weak convergence

Mathematics Subject Classification ID

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

Review text

Summary: In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued convex function, we construct two new algorithms for the split feasibility problem and prove that both of them are convergent weakly to a solution of the feasibility problem. In the end, as an application, we obtain a new algorithm for solving the split equality problem.

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

Cites work

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

Cited in

(4)

• Polyak's gradient method for split feasibility problem constrained by level sets
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• Strongly convergent ball-relaxed CQ algorithm and its application
• Multi-step inertial algorithms for equilibrium, fixed point, general systems of variational inequalities and split feasibility problems

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)