The following pages link to (Q4010376):
Displaying 50 items.
- A Note on Coding and Standardization of Categorical Variables in (Sparse) Group Lasso Regression (Q146016) (← links)
- Ritt operators and convergence in the method of alternating projections (Q259103) (← links)
- A convergence result on random products of mappings in metric spaces (Q368395) (← links)
- A convergence result on random products of mappings in metric trees (Q372541) (← links)
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence (Q606677) (← links)
- There is no variational characterization of the cycles in the method of periodic projections (Q652441) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings (Q824722) (← links)
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems (Q982653) (← links)
- Dykstra's algorithm for constrained least-squares rectangular matrix problems (Q1130433) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- An estimate for Lipschitz constants of metric projections (Q1283001) (← links)
- On the convergence of von Neumann's alternating projection algorithm for two sets (Q1308949) (← links)
- The rate of convergence for the method of alternating projections. II (Q1353696) (← links)
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems (Q1630420) (← links)
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces (Q1770096) (← links)
- An alternating projection that does not converge in norm (Q1881089) (← links)
- Stochastic alternating projections (Q1928866) (← links)
- Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III. (Q1990908) (← links)
- Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators (Q2015484) (← links)
- On the method of reflections (Q2038432) (← links)
- An inertial extrapolation method for multiple-set split feasibility problem (Q2069587) (← links)
- An inertial triple-projection algorithm for solving the split feasibility problem (Q2097467) (← links)
- Cyclic projections in Hadamard spaces (Q2156394) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- A cyclic Douglas-Rachford iteration scheme (Q2250057) (← links)
- Inertial accelerated algorithms for solving a split feasibility problem (Q2397577) (← links)
- Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections (Q2406495) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- On the rate of convergence of the alternating projection method in finite dimensional spaces (Q2566096) (← links)
- Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones (Q2570742) (← links)
- An iteration method to solve multiple constrained least squares problems (Q2628358) (← links)
- Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey (Q2897283) (← links)
- A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets (Q3599881) (← links)
- The method of alternating projections and the method of subspace corrections in Hilbert space (Q4330566) (← links)
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings (Q4386120) (← links)
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space (Q4386129) (← links)
- Accelerating the convergence of the method of alternating projections (Q4417269) (← links)
- Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery (Q4559404) (← links)
- Relaxed inertial accelerated algorithms for solving split equality feasibility problem (Q4632558) (← links)
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space (Q4846117) (← links)
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections (Q5013582) (← links)
- Some developments around the Katznelson–Tzafriri theorem (Q5046937) (← links)
- (Q5153530) (← links)
- Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization (Q5236633) (← links)
- (Q5376969) (← links)
- The method of subspace corrections (Q5931480) (← links)
