Pages that link to "Item:Q3923522"
From MaRDI portal
The following pages link to Row-Action Methods for Huge and Sparse Systems and Their Applications (Q3923522):
Displayed 50 items.
- New methods for linear inequalities (Q1162118) (← links)
- Strong underrelaxation in Kaczmarz's method for inconsistent systems (Q1166890) (← links)
- Solution of underdetermined nonlinear equations by stationary iteration methods (Q1170863) (← links)
- A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
- Domain decomposition for parallel row projection algorithms (Q1181532) (← links)
- Level-constrained programming (Q1184818) (← links)
- Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach (Q1207809) (← links)
- A parallel projection method for overdetermined nonlinear systems of equations (Q1208707) (← links)
- Nonlinear relaxation methods for solving symmetric linear complementary problems (Q1263533) (← links)
- Acceleration schemes for the method of alternating projections (Q1263944) (← links)
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (Q1272854) (← links)
- The simple block iterative algorithm of an extended entropy model and its convergence (Q1299869) (← links)
- New iterative methods for linear inequalities (Q1321142) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- Parallel projection methods and the resolution of ill-posed problems (Q1324388) (← links)
- A row-action method for convex programming (Q1330898) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- A proximal point algorithm for minimax problems (Q1371666) (← links)
- Inhomogeneous turbulent field diagnostics by distance-dependent tomographic reconstruction techniques (Q1375902) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Supplementary projections for the acceleration of Kaczmarz algorithm (Q1646081) (← links)
- A new greedy Kaczmarz algorithm for the solution of very large linear systems (Q1726657) (← links)
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces (Q1770096) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- A projection method for least-squares solutions to overdetermined systems of linear inequalities (Q1821512) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- An acceleration scheme for row projection methods (Q1893597) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods (Q1955636) (← links)
- On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
- A learning-enhanced projection method for solving convex feasibility problems (Q2064511) (← links)
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems (Q2066187) (← links)
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems (Q2085033) (← links)
- Randomized Kaczmarz for tensor linear systems (Q2114108) (← links)
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems (Q2116037) (← links)
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
- Restarted randomized surrounding methods for solving large linear equations (Q2161478) (← links)
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces (Q2168686) (← links)
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem (Q2176283) (← links)
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631) (← links)
- Enhancement of the Kaczmarz algorithm with projection adjustment (Q2200803) (← links)
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems (Q2225527) (← links)
- On convergence rate of the randomized Gauss-Seidel method (Q2228499) (← links)
- Strong convergence of a self-adaptive method for the split feasibility problem (Q2253220) (← links)