Pages that link to "Item:Q1091948"

The following pages link to A parallel subgradient projections method for the convex feasibility problem (Q1091948):

Displaying 7 items.

• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
• Extrapolation and local acceleration of an iterative process for common fixed point problems (Q442508) (← links)
• Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
• Superiorization with level control (Q5346628) (← links)
• A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (Q6157447) (← links)