Row-Action Methods for Huge and Sparse Systems and Their Applications
From MaRDI portal
game theoryimage reconstruction from projection, operations researchinterval convex programming problemsiterative procedureslearning theorylinear feasibility problemslinearly constrained optimization problemsnonlinear convex feasibility problempattern recognitionrow-action methodstransportation theory
Cited in
(only showing first 100 items - show all)- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Fejér processes with diminishing disturbances
- An automatic relaxation method for solving interval linear inequalities
- A note on the ART of relaxation
- Convergence results for an accelerated nonlinear Cimmino algorithm
- A relaxed version of Bregman's method for convex programming
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- Solution of nonlinear systems of equations by an optimal projection method
- 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 parallel subgradient projections method for the convex feasibility problem
- 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
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- A finitely convergent ``row-action method for the convex feasibility problem
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A parallel projection method for solving generalized linear least-squares problems
- Smallest point of a polytope
- An iterative row-action method for interval convex programming
- New methods for linear inequalities
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Solution of underdetermined nonlinear equations by stationary iteration methods
- A row relaxation method for large \(l_ 1\) problems
- Domain decomposition for parallel row projection algorithms
- Level-constrained programming
- Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach
- A parallel projection method for overdetermined nonlinear systems of equations
- Nonlinear relaxation methods for solving symmetric linear complementary problems
- Acceleration schemes for the method of alternating projections
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- The simple block iterative algorithm of an extended entropy model and its convergence
- New iterative methods for linear inequalities
- A unified description of iterative algorithms for traffic equilibria
- Parallel projection methods and the resolution of ill-posed problems
- A row-action method for convex programming
- A review of combinatorial problems arising in feedforward neural network design
- A multiprojection algorithm using Bregman projections in a product space
- Block-iterative surrogate projection methods for convex feasibility problems
- A proximal point algorithm for minimax problems
- Inhomogeneous turbulent field diagnostics by distance-dependent tomographic reconstruction techniques
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- An MM Algorithm for Split Feasibility Problems
- Symbiosis between linear algebra and optimization
- Supplementary projections for the acceleration of Kaczmarz algorithm
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- The adventures of a simple algorithm
- An acceleration scheme for row projection methods
- A parallel relaxation method for quadratic programming problems with interval constraints
- Primal-dual row-action method for convex programming
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On Motzkin's method for inconsistent linear systems
- A learning-enhanced projection method for solving convex feasibility problems
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- Randomized Kaczmarz for tensor linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Restarted randomized surrounding methods for solving large linear equations
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- Enhancement of the Kaczmarz algorithm with projection adjustment
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- On convergence rate of the randomized Gauss-Seidel method
- Strong convergence of a self-adaptive method for the split feasibility problem
- A refinement of an iterative orthogonal projection method
- On the error estimate of the randomized double block Kaczmarz method
- Variant of greedy randomized Kaczmarz for ridge regression
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Optimization models for reaction networks: information divergence, quadratic programming and Kirchhoff's laws
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Convergence rates for Kaczmarz-type algorithms
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- How good are projection methods for convex feasibility problems?
- New class of multiplicative algorithms for solving of entropy-linear programs
- A primal-dual iterative algorithm for a maximum likelihood estimation problem
- Algorithms for the quasiconvex feasibility problem
- A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods
- Randomized block Kaczmarz methods with k-means clustering for solving large linear systems
- Kaczmarz's anomaly: a surprising feature of Kaczmarz's method
- The direct-projection methods
- Opial-type theorems and the common fixed point problem
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Single-projection procedure for linear optimization
- A general iterative scheme with applications to convex optimization and related fields
- Single projection Kaczmarz extended algorithms
- Projection methods: an annotated bibliography of books and reviews
- Randomized iterative methods for linear systems
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Projection methods for the linear split feasibility problems
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
This page was built for publication: Row-Action Methods for Huge and Sparse Systems and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923522)