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

DOI10.1007/S10492-014-0040-ZzbMATH Open1313.90219OpenAlexW1998930720MaRDI QIDQ742898FDOQ742898

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

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

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)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• A multiprojection algorithm using Bregman projections in a product space
• 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
• Iterative oblique projection onto convex sets and the split feasibility problem
• A note on the multiple-set split convex feasibility problem in Hilbert space
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
• Title not available (Why is that?)
• The relaxed CQ algorithm solving the split feasibility problem
• Decomposition through formalization in a product space
• Title not available (Why is that?)
• Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

Cited In (11)

• Inexact averaged projection algorithm for nonconvex multiple-set split feasibility problems
• Properties of subgradient projection iteration when applying to linear imaging system
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• Title not available (Why is that?)
• An efficient simultaneous method for the constrained multiple-sets split feasibility problem
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• A conjugate gradient algorithm for solving the multiple-sets split feasibility problem
• A new relaxed projection method to solve the multiple-sets split feasibility problem
• A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
• Extrapolation algorithm for affine-convex feasibility problems
• An improved method for solving 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)