scientific article; zbMATH DE number 1070394

MaRDI QIDQ4356871zbMATHFDO

Authors Krzysztof C. Kiwiel, Bożena Łopuch

Publication date 20 November 1997

zbMATH Keywords

relaxation methodsconvex feasibility problemssuccessive projectionssurrogate inequalities

Mathematics Subject Classification ID

Convex programming (90C25) Discrete-time Markov processes on general state spaces (60J05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Recommendations

• scientific article; zbMATH DE number 1264398
• Block-iterative surrogate projection methods for convex feasibility problems
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

Cited in

(5)

• An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• Block-iterative surrogate projection methods for convex feasibility problems
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• scientific article; zbMATH DE number 1264398 (Why is no real title available?)

This page was built for publication:

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