A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.

DOI10.1007/S10492-014-0040-ZzbMath1313.90219OpenAlexW1998930720MaRDI QIDQ742898

Yan Gao, Ya-Zheng Dang

Publication date: 19 September 2014

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143597

zbMATH Keywords

subgradientmultiple-sets split feasibility problemextrapolated technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem ⋮ Unnamed Item ⋮ Properties of subgradient projection iteration when applying to linear imaging system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• The strong convergence of a KM–CQ-like algorithm for a 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
• Decomposition through formalization in a product space
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

This page was built for publication: A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.