A strongly convergent algorithm for the convex feasibility problem

MaRDI QIDQ2885672zbMATH OpenFDO

Authors Yan Gao, Jianfang Yang, Yazheng Dang

Publication date 1 June 2012

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

strong convergenceconvex feasibility problemproduct spacemodified parallel projection algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• A strongly convergent parallel projection algorithm for convex feasibility problem
• A parallel subgradient projections method for the convex feasibility problem
• scientific article; zbMATH DE number 7213713
• A parallel approximate subgradient projection algorithm for convex feasibility problem
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems

Cited in

(3)

• A strongly convergent parallel projection algorithm for convex feasibility problem
• scientific article; zbMATH DE number 6263278 (Why is no real title available?)
• scientific article; zbMATH DE number 7213713 (Why is no real title available?)

This page was built for publication: A strongly convergent algorithm for the convex feasibility problem

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