Pages that link to "Item:Q4277518"
From MaRDI portal
The following pages link to Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem (Q4277518):
Displaying 12 items.
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems (Q817152) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- A class of optimized row projection methods for solving large nonsymmetric linear systems (Q1612435) (← links)
- On the incomplete oblique projections method for solving box constrained least squares problems (Q2453469) (← links)
- Incomplete oblique projections for solving large inconsistent linear systems (Q2467156) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem (Q2927188) (← links)
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters (Q4351445) (← links)
