scientific article; zbMATH DE number 3029984
From MaRDI portal
Publication:5769827
Cited in
(27)- Projection and proximal point methods: Convergence results and counterexamples.
- Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
- Projection-minimization methods for nonsymmetric linear systems
- On the method of reflections
- The circumcentered-reflection method achieves better rates than alternating projections
- Restarted randomized surrounding methods for solving large linear equations
- Scalable parallel algorithm for solving non-stationary systems of linear inequalities
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Projection methods in Krylov subspaces
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- 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
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems
- The numerics of phase retrieval
- 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
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- A finitely convergent circumcenter method for the convex feasibility problem
- Survey of a class of iterative row-action methods: the Kaczmarz method
- Linear optimization by conical projection
- A strongly convergent simultaneous cutter method for finding the minimal norm solution to common fixed point problem
- 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
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 Q5769827)