Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
From MaRDI portal
(Redirected from Publication:4785757)
Recommendations
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- An alternating projection algorithm for finding feasible points of block-diagonal semidefinite constraints
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- scientific article; zbMATH DE number 31273
- An improved block modulus method for diagonally dominant linear complementarity problems
Cited in
(54)- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems
- String-averaging algorithms for convex feasibility with infinitely many sets
- Convergence results of Landweber iterations for linear systems
- Kaczmarz method with oblique projection
- Extended Kaczmarz-like methods with oblique projections
- Computational acceleration of projection algorithms for the linear best approximation problem
- Inexact block Newton methods for solving nonlinear equations
- The convergence properties for regularized Landweber method
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- A preconditioned Landweber iteration-based bundle adjustment for large-scale 3D reconstruction
- Computationally Efficient Decompositions of Oblique Projection Matrices
- A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
- On Diagonally Relaxed Orthogonal Projection Methods
- Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
- Generalized projections onto convex sets
- Average block column action methods for solving least squares problems
- Convergence of string-averaging method for a class of operators
- An adaptive block iterative CQ algorithm of furthest projection
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- A projection method for semidefinite linear systems and its applications
- A generalized iterative method and comparison results using projection techniques for solving linear systems
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Convergence analysis of SART: optimization and statistics
- On the incomplete oblique projections method for solving box constrained least squares problems
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Weighted pseudoinversion with indefinite weights
- scientific article; zbMATH DE number 125933 (Why is no real title available?)
- Methods for computing weighted pseudoinverses and weighted normal pseudosolutions with singular weights
- Weighted pseudoinversion with singular weights
- On the string averaging method for sparse common fixed-point problems
- Perturbation-resilient iterative methods with an infinite pool of mappings
- A general extending and constraining procedure for linear iterative methods
- A new step size rule for the superiorization method and its application in computerized tomography
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Incomplete oblique projections for solving large inconsistent linear systems
- Numerical investigation of Fredholm integral equation of the first kind with noisy data
- Choosing the relaxation parameter in sequential block-iterative methods for linear systems
- Notes on flexible sequential block iterative methods
- Landweber scheme for compact operator equation in Hilbert space and its applications
- Sampling and reconstruction by means of weighted inverses
- Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights
- Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. II. singular weights
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Controlling noise error in block iterative methods
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Weighted Generalized Inverses, Oblique Projections, and Least-Squares Problems
- Convergence studies on block iterative algorithms for image reconstruction
- Convergence analysis for column-action methods in image reconstruction
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
- Iterative algorithms with seminorm-induced oblique projections
This page was built for publication: Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785757)
