Pages that link to "Item:Q2502868"

The following pages link to A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space (Q2502868):

Displaying 16 items.

• The strong convergence of a three-step algorithm for the split feasibility problem (Q360514) (← links)
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting (Q452068) (← links)
• Common solutions to variational inequalities (Q452274) (← links)
• A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
• A parallel extragradient-like projection method for unrelated variational inequalities and fixed point problems (Q721215) (← links)
• A new double-projection method for solving variational inequalities in Banach spaces (Q1670018) (← links)
• On sums and convex combinations of projectors onto convex sets (Q1740660) (← links)
• A new extragradient-type algorithm for the split feasibility problem (Q1793475) (← links)
• Averaged alternating reflections in geodesic spaces (Q1947318) (← links)
• Projective splitting methods for sums of maximal monotone operators with applications (Q2257570) (← links)
• Hybrid shrinking iterative solutions to convex feasibility problems for countable families of relatively nonexpansive mappings and a system of generalized mixed equilibrium problems (Q2264139) (← links)
• A Mann type hybrid generalized \(f\)-projection iterative method for a class of nonlinear mappings (Q2409476) (← links)
• New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses (Q2789608) (← links)
• Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions (Q2795102) (← links)
• The Douglas–Rachford Algorithm in the Absence of Convexity (Q2897277) (← links)
• Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space (Q3096883) (← links)