Pages that link to "Item:Q2189471"
From MaRDI portal
The following pages link to The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471):
Displaying 14 items.
- The circumcentered-reflection method achieves better rates than alternating projections (Q2044486) (← links)
- Constraint reduction reformulations for projection algorithms with applications to wavelet construction (Q2046564) (← links)
- Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
- A product space reformulation with reduced dimension for splitting algorithms (Q2162533) (← links)
- The block-wise circumcentered-reflection method (Q2191785) (← links)
- Strengthened splitting methods for computing resolvents (Q2231047) (← links)
- On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
- Circumcentric directions of cones (Q6043123) (← links)
- Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions (Q6043138) (← links)
- On the centralization of the circumcentered-reflection method (Q6126653) (← links)
- Regularity of sets under a reformulation in a product space with reduced dimension (Q6141904) (← links)
- Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems (Q6173957) (← links)
- A successive centralized circumcentered-reflection method for the convex feasibility problem (Q6179873) (← links)
- Strict pseudocontractions and demicontractions, their properties, and applications (Q6202787) (← links)
