Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142): Difference between revisions

@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+On the Goldstein-Levitin-Polyak gradient projection method
+Normal rank
@@ Property / cites work @@
+Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
+Normal rank
@@ Property / cites work @@
+Relaxed Alternating Projection Methods
@@ Property / cites work: Relaxed Alternating Projection Methods / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic subgradient projections
@@ Property / cites work: Cyclic subgradient projections / rank @@
+Normal rank
@@ Property / cites work @@
+A finitely convergent ``row-action'' method for the convex feasibility problem
+Normal rank
@@ Property / cites work @@
+Finite-Dimensional Variational Inequalities and Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A relaxed projection method for variational inequalities
+Normal rank
@@ Property / cites work @@
+Inexact implicit methods for monotone general variational inequalities
+Normal rank
@@ Property / cites work @@
+A relaxation method for reconstructing objects from noisy X-rays
+Normal rank
@@ Property / cites work @@
+A note on the                     <i>CQ</i>                     algorithm for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Some recent advances in projection-type methods for variational inequalities
+Normal rank
@@ Property / cites work @@
+The relaxed CQ algorithm solving the split feasibility problem
+Normal rank