A family of projection gradient methods for solving the multiple-sets split feasibility problem

DOI10.1007/s10957-019-01563-2zbMath1429.90052OpenAlexW2957157706WikidataQ127590854 ScholiaQ127590854MaRDI QIDQ2275325

Xiaojun Zhuang, Carisa Kwok Wai Yu, Yao-Hua Hu, Jin-Hua Wang

Publication date: 2 October 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-019-01563-2

zbMATH Keywords

multiple-sets split feasibility problemglobal weak convergenceprojection gradient methods

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Iterative procedures involving nonlinear operators (47J25)

Related Items (9)

Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ New iterative regularization methods for the multiple-sets split feasibility problem ⋮ A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets

Cites Work

• Unnamed Item
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
• Hilbertian convex feasibility problem: Convergence of projection methods
• Reflection-projection method for convex feasibility problems with an obtuse cone
• A multiprojection algorithm using Bregman projections in a product space
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• A simple projection method for solving the multiple-sets split feasibility problem
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set 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
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Group sparse optimization via $\ell_{p,q}$ regularization
• The method of projections for finding the common point of convex sets
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A family of projection gradient methods for solving the multiple-sets split feasibility problem