Strong convergence of a self-adaptive method for the split feasibility problem (Q2253220): Difference between revisions

@@ 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.1186/1687-1812-2013-201
+Normal rank
@@ Property / OpenAlex ID @@
+W2169188538
@@ Property / OpenAlex ID: W2169188538 / rank @@
+Normal rank
@@ Property / cites work @@
+A multiprojection algorithm using Bregman projections in a product space
+Normal rank
@@ Property / cites work @@
+Q3764034
@@ Property / cites work: Q3764034 / rank @@
+Normal rank
@@ Property / cites work @@
+An extragradient method for solving split feasibility and fixed point problems
+Normal rank
@@ Property / cites work @@
+Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
+Normal rank
@@ Property / cites work @@
+Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+On the behavior of a block-iterative projection method for solving convex feasibility problems
+Normal rank
@@ Property / cites work @@
+Row-Action Methods for Huge and Sparse Systems and Their Applications
+Normal rank
@@ Property / cites work @@
+The method of projections for finding the common point of convex sets
+Normal rank
@@ Property / cites work @@
+A successive projection method
@@ Property / cites work: A successive projection method / rank @@
+Normal rank
@@ Property / cites work @@
+On the convergence of Han's method for convex programming with quadratic objective
+Normal rank
@@ Property / cites work @@
+Q5580053
@@ Property / cites work: Q5580053 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative oblique projection onto convex sets and the split feasibility problem
+Normal rank
@@ Property / cites work @@
+A unified treatment of some iterative algorithms in signal processing and image reconstruction
+Normal rank
@@ Property / cites work @@
+Q2768012
@@ Property / cites work: Q2768012 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3644265
@@ Property / cites work: Q3644265 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
+Normal rank
@@ Property / cites work @@
+A relaxed projection method for variational inequalities
+Normal rank
@@ Property / cites work @@
+A note on the                     <i>CQ</i>                     algorithm for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Cyclic algorithms for split feasibility problems in Hilbert spaces
+Normal rank
@@ Property / cites work @@
+The relaxed inexact projection methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
+Normal rank
@@ Property / cites work @@
+Averaged mappings and the gradient-projection algorithm
+Normal rank
@@ Property / cites work @@
+Several solution methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Self-adaptive projection methods for the multiple-sets split feasibility problem
+Normal rank
@@ Property / cites work @@
+Regularized methods for the split feasibility problem
+Normal rank
@@ Property / cites work @@
+Extragradient-projection method for solving constrained convex minimization problems
+Normal rank
@@ Property / cites work @@
+Some iterative methods for finding fixed points and for solving constrained convex minimization problems
+Normal rank
@@ Property / cites work @@
+Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
+Normal rank
@@ Property / cites work @@
+Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
+Normal rank
@@ Property / cites work @@
+Convex programming in Hilbert space
@@ Property / cites work: Convex programming in Hilbert space / rank @@
+Normal rank
@@ Property / cites work @@
+Solving linear variational inequality problems by a self-adaptive projection method
+Normal rank
@@ Property / cites work @@
+Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
+Normal rank
@@ Property / cites work @@
+A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
+Normal rank
@@ Property / cites work @@
+Self-adaptive projection method for co-coercive variational inequalities
+Normal rank
@@ Property / cites work @@
+Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities.
+Normal rank
@@ Property / cites work @@
+On variable-step relaxed projection algorithm for variational inequalities
+Normal rank
@@ Property / cites work @@
+A self-adaptive projection method for solving the multiple-sets split feasibility problem
+Normal rank
@@ Property / cites work @@
+The multiple-sets split feasibility problem and its applications for inverse problems
+Normal rank
@@ Property / cites work @@
+Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
+Normal rank
@@ Property / cites work @@
+Iterative Algorithms for Nonlinear Operators
@@ Property / cites work: Iterative Algorithms for Nonlinear Operators / rank @@
+Normal rank
@@ Property / cites work @@
+Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
+Normal rank