The following pages link to (Q4115737):
Displaying 18 items.
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces (Q596824) (← links)
- Local linear convergence for alternating and averaged nonconvex projections (Q839655) (← links)
- Strong convergence of projection-like methods in Hilbert spaces (Q1089908) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Reconstruction of functions from prescribed proximal points (Q2037075) (← links)
- Prox-regularity of rank constraint sets and implications for algorithms (Q2251196) (← links)
- Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem (Q2350395) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space (Q2502868) (← links)
- The Douglas–Rachford Algorithm in the Absence of Convexity (Q2897277) (← links)
- Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
- Decomposition through formalization in a product space (Q3673556) (← links)
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings (Q4386120) (← links)
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space (Q4386129) (← links)
- Construction of best Bregman approximations in reflexive Banach spaces (Q4425413) (← links)
- Resolvent and proximal compositions (Q6163860) (← links)
