Row-Action Methods for Huge and Sparse Systems and Their Applications

DOI10.1137/1023097zbMath0469.65037OpenAlexW2000748685MaRDI QIDQ3923522

Yair Censor

Publication date: 1981

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1023097

zbMATH Keywords

game theorypattern recognitionlearning theoryrow-action methodsiterative procedureslinearly constrained optimization problemsimage reconstruction from projection, operations researchinterval convex programming problemslinear feasibility problemsnonlinear convex feasibility problemtransportation theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)

Related Items (only showing first 100 items - show all)

A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm ⋮ Asymptotically optimal row-action methods for generalized least squares problems ⋮ Opial-Type Theorems and the Common Fixed Point Problem ⋮ Projection methods: an annotated bibliography of books and reviews ⋮ Randomized Iterative Methods for Linear Systems ⋮ A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction ⋮ On the asymptotic behavior of some alternate smoothing series expansion iterative methods ⋮ On finitely convergent iterative methods for the convex feasibility problem ⋮ PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ Iterations of parallel convex projections in hilbert spaces ⋮ Unrestricted iterations of nonexpansive mappings in Hilbert space ⋮ Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems ⋮ On the behavior of a block-iterative projection method for solving convex feasibility problems ⋮ Strong convergence of expected-projection methods in hilbert spaces ⋮ Convergence rates for Kaczmarz-type algorithms ⋮ Convergence of the multiplicative algebraic reconstruction technique for the inconsistent system of equations ⋮ On Block-Iterative Entropy Maximization ⋮ On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations ⋮ Interval underrelaxed bregman's method with an application ⋮ Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces ⋮ How good are projection methods for convex feasibility problems? ⋮ Kaczmarz's anomaly: a surprising feature of Kaczmarz's method ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ The use of additional diminishing disturbances in Fejer models of iterative algorithms ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ Projection methods for the linear split feasibility problems ⋮ On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Application of the Finite Inclusions Theorem to robust analysis and synthesis ⋮ The direct-projection methods ⋮ Optimal selections of stepsizes and blocks for the block-iterative ART ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ A partial linearization method for the traffic assignment problem ⋮ On SSOR‐like preconditioners for non‐Hermitian positive definite matrices ⋮ New class of multiplicative algorithms for solving of entropy-linear programs ⋮ The Kaczmarz algorithm, row action methods, and statistical learning algorithms ⋮ A refinement of an iterative orthogonal projection method ⋮ Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem ⋮ A general iterative scheme with applications to convex optimization and related fields ⋮ Faster Randomized Block Kaczmarz Algorithms ⋮ On the error estimate of the randomized double block Kaczmarz method ⋮ Unrestricted iterations of nonexpansive mappings in Banach spaces ⋮ Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities ⋮ Variant of greedy randomized Kaczmarz for ridge regression ⋮ On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems ⋮ A primal-dual iterative algorithm for a maximum likelihood estimation problem ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems ⋮ Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin ⋮ Algorithms for the quasiconvex feasibility problem ⋮ On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems ⋮ Optimization models for reaction networks: information divergence, quadratic programming and Kirchhoff's laws ⋮ A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems ⋮ Hildreth's algorithm with applications to soft constraints for user interface layout ⋮ Generalized Gearhart-Koshy acceleration for the Kaczmarz method ⋮ A row-action method for convex programming ⋮ A review of combinatorial problems arising in feedforward neural network design ⋮ Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations ⋮ Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method ⋮ Strong convergence of projection-like methods in Hilbert spaces ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ A parallel subgradient projections method for the convex feasibility problem ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ An acceleration scheme for row projection methods ⋮ Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography ⋮ A computational solution of the inverse problem in radiation-therapy treatment planning ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ Supplementary projections for the acceleration of Kaczmarz algorithm ⋮ A parallel relaxation method for quadratic programming problems with interval constraints ⋮ Single-projection procedure for linear optimization ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ Primal-dual row-action method for convex programming ⋮ Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines ⋮ Single projection Kaczmarz extended algorithms ⋮ A finitely convergent ``row-action method for the convex feasibility problem ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ Restarted randomized surrounding methods for solving large linear equations ⋮ A parallel projection method for solving generalized linear least-squares problems ⋮ A proximal point algorithm for minimax problems ⋮ Smallest point of a polytope ⋮ Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces ⋮ Subgradient projection algorithms and approximate solutions of convex feasibility problems ⋮ Inhomogeneous turbulent field diagnostics by distance-dependent tomographic reconstruction techniques ⋮ Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem ⋮ Block Kaczmarz method with inequalities ⋮ An iterative row-action method for interval convex programming ⋮ On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems ⋮ Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. ⋮ Enhancement of the Kaczmarz algorithm with projection adjustment ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Distributed estimation via iterative projections with application to power network monitoring ⋮ The structure of some matrices arising in tomography

This page was built for publication: Row-Action Methods for Huge and Sparse Systems and Their Applications