scientific article; zbMATH DE number 3029984
From MaRDI portal
Publication:5769827
zbMath0018.41802MaRDI QIDQ5769827
Publication date: 1938
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ The numerics of phase retrieval ⋮ Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization ⋮ Projection-minimization methods for nonsymmetric linear systems ⋮ Restarted randomized surrounding methods for solving large linear equations ⋮ Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators ⋮ The Reflection Method for the Numerical Solution of Linear Systems ⋮ Inversion of a generalized Radon transform by algebraic iterative methods ⋮ The method of randomized Bregman projections for stochastic feasibility problems ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Scalable parallel algorithm for solving non-stationary systems of linear inequalities ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ Column-oriented algebraic iterative methods for nonnegative constrained least squares problems ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ Projection methods in Krylov subspaces ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs ⋮ On the method of reflections ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ Iterative methods for linear systems of equations: A brief historical journey ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
