scientific article
From MaRDI portal
Publication:4010376
zbMath0751.41031MaRDI QIDQ4010376
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (51)
Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings ⋮ An alternating projection that does not converge in norm ⋮ Some developments around the Katznelson–Tzafriri theorem ⋮ Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ An iteration method to solve multiple constrained least squares problems ⋮ The rate of convergence for the method of alternating projections. II ⋮ Cyclic projections in Hadamard spaces ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ A convergence result on random products of mappings in metric spaces ⋮ A convergence result on random products of mappings in metric trees ⋮ Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections ⋮ Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence ⋮ Dykstra's algorithm for constrained least-squares rectangular matrix problems ⋮ Stochastic alternating projections ⋮ The method of randomized Bregman projections for stochastic feasibility problems ⋮ The method of alternating projections and the method of subspace corrections in Hilbert space ⋮ There is no variational characterization of the cycles in the method of periodic projections ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ Relaxed inertial accelerated algorithms for solving split equality feasibility problem ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III. ⋮ Non-monotonous sequential subgradient projection algorithm for convex feasibility problem ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ The method of subspace corrections ⋮ A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space ⋮ Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces ⋮ Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems ⋮ A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets ⋮ Accelerating the convergence of the method of alternating projections ⋮ On the method of reflections ⋮ A Note on Coding and Standardization of Categorical Variables in (Sparse) Group Lasso Regression ⋮ Unnamed Item ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ An estimate for Lipschitz constants of metric projections ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ On the rate of convergence of the alternating projection method in finite dimensional spaces ⋮ Algorithms for the quasiconvex feasibility problem ⋮ Dykstra's algorithm with strategies for projecting onto certain polyhedral cones ⋮ Unnamed Item ⋮ An inertial triple-projection algorithm for solving the split feasibility problem ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ On the convergence of von Neumann's alternating projection algorithm for two sets ⋮ Ritt operators and convergence in the method of alternating projections
This page was built for publication:
