scientific article; zbMATH DE number 65765
From MaRDI portal
Publication:4010376
zbMATH Open0751.41031MaRDI QIDQ4010376FDOQ4010376
Authors: F. Deutsch 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Cited In (54)
- Generalized alternating projections on manifolds and convex sets
- Analytic formulas for alternating projection sequences for the positive semidefinite cone and an application to convergence analysis
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings
- An inertial triple-projection algorithm for solving the split feasibility problem
- The method of randomized Bregman projections for stochastic feasibility 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
- Title not available (Why is that?)
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Ritt operators and convergence in the method of alternating projections
- 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
- Cyclic projections in Hadamard spaces
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
- Algorithms for the quasiconvex feasibility problem
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Hilbertian convex feasibility problem: Convergence of projection methods
- Arbitrarily slow convergence of sequences of linear operators: a survey
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
- An alternating projection that does not converge in norm
- Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III.
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Inertial accelerated algorithms for solving a split feasibility problem
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- Relaxed inertial accelerated algorithms for solving split equality feasibility problem
- A cyclic Douglas-Rachford iteration scheme
- There is no variational characterization of the cycles in the method of periodic projections
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
- An inertial extrapolation method for multiple-set split feasibility problem
- The method of subspace corrections
- The tube method for the moment index in projection pursuit
- A convergence result on random products of mappings in metric spaces
- A convergence result on random products of mappings in metric trees
- Stochastic alternating projections
- A note on coding and standardization of categorical variables in (sparse) group Lasso regression
- An estimate for Lipschitz constants of metric projections
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- The rate of convergence for the method of alternating projections. II
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
- Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections
- Extrapolation algorithm for affine-convex feasibility problems
- On the method of reflections
- Some developments around the Katznelson-Tzafriri theorem
- Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
- An iteration method to solve multiple constrained least squares problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010376)
