Pages that link to "Item:Q3395006"

The following pages link to Relaxed Alternating Projection Methods (Q3395006):

Displaying 15 items.

• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
• The alternating algorithm in a uniformly convex and uniformly smooth Banach space (Q401401) (← links)
• On the existence of minimizers of proximity functions for split feasibility problems (Q495733) (← links)
• Alternating projection method for sparse model updating problems (Q525263) (← links)
• Variable target value relaxed alternating projection method (Q616797) (← links)
• Random algorithms for convex minimization problems (Q644912) (← links)
• Incremental proximal methods for large scale convex optimization (Q644913) (← links)
• Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
• Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
• Incremental constraint projection methods for variational inequalities (Q2340334) (← links)
• Incomplete alternating projection method for large inconsistent linear systems (Q2472379) (← links)
• Stochastic first-order methods with random constraint projection (Q2796796) (← links)
• Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142) (← links)
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities (Q5219716) (← links)
• An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)