Pages that link to "Item:Q2494384"
From MaRDI portal
The following pages link to Extrapolation algorithm for affine-convex feasibility problems (Q2494384):
Displaying 37 items.
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- An extrapolated iterative algorithm for multiple-set split feasibility problem (Q437508) (← links)
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes (Q486223) (← links)
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
- Numerical methods for solving some matrix feasibility problems (Q509640) (← links)
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations (Q511032) (← links)
- Variable target value relaxed alternating projection method (Q616797) (← links)
- Incremental proximal methods for large scale convex optimization (Q644913) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem (Q860662) (← links)
- Functions with prescribed best linear approximations (Q976207) (← links)
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems (Q1630420) (← links)
- Reconstruction of functions from prescribed proximal points (Q2037075) (← links)
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems (Q2116037) (← links)
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems (Q2191802) (← links)
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures (Q2260660) (← links)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044) (← links)
- Variance reduction for root-finding problems (Q2689823) (← links)
- Convergence of string-averaging method for a class of operators (Q2829581) (← links)
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
- Accelerated reflection projection algorithm and its application to the LMI problem (Q3453404) (← links)
- Linear convergence rates for extrapolated fixed point algorithms (Q4613991) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces (Q5065443) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators (Q5346621) (← links)
- A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space (Q5376969) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
- A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization (Q6051171) (← links)
- Average block column action methods for solving least squares problems (Q6584779) (← links)
- Efficient randomized block Kaczmarz method for linear feasibility (Q6661009) (← links)
