scientific article; zbMATH DE number 1070394

MaRDI QIDQ4356871zbMATH OpenFDO

Authors Krzysztof C. Kiwiel, Bożena Łopuch

Publication date 20 November 1997

zbMATH Keywords

convex feasibility problemsrelaxation methodssuccessive projectionssurrogate inequalities

Mathematics Subject Classification ID

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

Recommendations

• Long-step surrogate subgradient methods for convex feasibility problems
• Block-iterative surrogate projection methods for convex feasibility problems
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

Cited in

(5)

• Block-iterative surrogate projection methods for convex feasibility problems
• An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Long-step surrogate subgradient methods for convex feasibility problems
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

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)