A new \(CQ\) method for solving split feasibility problem (Q2266829): Difference between revisions

@@ Property / DOI @@
-.1007/s11464-009-0047-z
@@ Property / DOI: 10.1007/s11464-009-0047-z / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11464-009-0047-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1991115745
@@ Property / OpenAlex ID: W1991115745 / rank @@
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Q2768012
@@ Property / cites work: Q2768012 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative oblique projection onto convex sets and the split feasibility problem
+Normal rank
@@ Property / cites work @@
+A multiprojection algorithm using Bregman projections in a product space
+Normal rank
@@ Property / cites work @@
+A note on the                     <i>CQ</i>                     algorithm for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+The relaxed CQ algorithm solving the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Q4767830
@@ Property / cites work: Q4767830 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11464-009-0047-Z
@@ Property / DOI: 10.1007/S11464-009-0047-Z / rank @@
+Normal rank