Pages that link to "Item:Q4417269"

The following pages link to Accelerating the convergence of the method of alternating projections (Q4417269):

Displaying 48 items.

• On local convergence of the method of alternating projections (Q285438) (← links)
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
• A new geometric acceleration of the von Neumann-Halperin projection method (Q333597) (← links)
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
• Acceleration of the alternating least squares algorithm for principal components analysis (Q452548) (← links)
• Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes (Q486223) (← links)
• Variable target value relaxed alternating projection method (Q616797) (← links)
• A Donoho-Stark criterion for stable signal recovery in discrete wavelet subspaces (Q633959) (← links)
• A computation study on an integrated alternating direction method of multipliers for large scale optimization (Q683915) (← links)
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
• Functions with prescribed best linear approximations (Q976207) (← links)
• Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods (Q990147) (← links)
• Projection and proximal point methods: Convergence results and counterexamples. (Q1426419) (← links)
• Alternating projection method for a class of tensor equations (Q1624670) (← links)
• Implicit error bounds for Picard iterations on Hilbert spaces (Q1639952) (← links)
• Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm (Q1679586) (← links)
• The forward-backward algorithm and the normal problem (Q1752641) (← links)
• On the linear convergence of circumcentered isometry methods (Q2021771) (← links)
• On the method of reflections (Q2038432) (← links)
• Stochastic proximal splitting algorithm for composite minimization (Q2047212) (← links)
• A learning-enhanced projection method for solving convex feasibility problems (Q2064511) (← links)
• Best approximation mappings in Hilbert spaces (Q2089791) (← links)
• The block-wise circumcentered-reflection method (Q2191785) (← links)
• On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections (Q2228383) (← links)
• A variational approach to the alternating projections method (Q2231321) (← links)
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle (Q2252928) (← links)
• Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
• Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
• Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044) (← links)
• On the rate of convergence of the alternating projection method in finite dimensional spaces (Q2566096) (← links)
• Gearhart-Koshy acceleration for affine subspaces (Q2661608) (← links)
• Accelerating the convergence of the method of alternating projections via a line search: A brief survey (Q2768017) (← links)
• The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces (Q2804207) (← links)
• (Q3071393) (← links)
• Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods (Q3114578) (← links)
• Optimal Ordering of Projections using Permutation Matrices and Angles between Projection Subspaces (Q3439187) (← links)
• (Q3694559) (← links)
• The method of alternating projections and the method of subspace corrections in Hilbert space (Q4330566) (← links)
• (Q5091985) (← links)
• On Subgradient Projectors (Q5255001) (← links)
• Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces (Q5348473) (← 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)
• Generalized Gearhart-Koshy acceleration for the Kaczmarz method (Q5879117) (← links)
• An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
• Comparing the methods of alternating and simultaneous projections for two subspaces (Q6146685) (← links)
• The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection (Q6158002) (← links)
• Row-Oriented Decomposition in Large-Scale Linear Optimization (Q6488344) (← links)