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

DOI10.1007/S10492-014-0040-ZMaRDI QIDQ742898zbMATH OpenOpenAlexFDO

Authors Yan Gao, Yazheng 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

multiple-sets split feasibility problemsubgradientextrapolated 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)

Recommendations

• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem
• An improved method for solving multiple-sets split feasibility problem
• A new relaxed projection method to solve the multiple-sets split feasibility problem

Cites work

• scientific article; zbMATH DE number 5777888 (Why is no real title available?)
• scientific article; zbMATH DE number 5624813 (Why is no real title available?)
• A multiprojection algorithm using Bregman projections in a product space
• A note on the multiple-set split convex feasibility problem in Hilbert space
• 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
• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• The relaxed CQ algorithm solving the split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem

Cited in

(11)

• An efficient simultaneous method for the constrained multiple-sets split feasibility problem
• Inexact averaged projection algorithm for nonconvex multiple-set split feasibility problems
• Properties of subgradient projection iteration when applying to linear imaging system
• Accelerated under-relaxed parallel projection algorithms for convex set theoretic image recovery problem
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• A new relaxed projection method to solve the multiple-sets split feasibility problem
• Extrapolation algorithm for affine-convex feasibility problems
• An improved method for solving multiple-sets split feasibility problem
• A conjugate gradient algorithm for solving the multiple-sets split feasibility problem
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem

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

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