Pages that link to "Item:Q1091948"
From MaRDI portal
The following pages link to A parallel subgradient projections method for the convex feasibility problem (Q1091948):
Displaying 33 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)
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations (Q1084834) (← links)
- Acceleration schemes for the method of alternating projections (Q1263944) (← links)
- Parallel projection methods and the resolution of ill-posed problems (Q1324388) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- An acceleration scheme for cyclic subgradient projections method (Q1938914) (← links)
- Enhancement of the Kaczmarz algorithm with projection adjustment (Q2200803) (← links)
- Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\) (Q2249834) (← links)
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures (Q2260660) (← links)
- AIR tools II: algebraic iterative reconstruction methods, improved implementation (Q2413493) (← links)
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods (Q2428132) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- Convergence of string-averaging method for a class of operators (Q2829581) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods (Q2943811) (← links)
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour (Q4613990) (← links)
- Linear convergence rates for extrapolated fixed point algorithms (Q4613991) (← links)
- The Averaged Kaczmarz Iteration for Solving Inverse Problems (Q4686928) (← links)
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm (Q4976159) (← links)
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem (Q5169443) (← links)
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators (Q5346621) (← links)
- Superiorization with level control (Q5346628) (← links)
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment (Q5346631) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (Q6157447) (← links)