Pages that link to "Item:Q3456879"
From MaRDI portal
The following pages link to Randomized Iterative Methods for Linear Systems (Q3456879):
Displaying 50 items.
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
- Iterative algorithms for large stochastic matrices (Q808164) (← links)
- Convergence of a randomized Douglas-Rachford method for linear system (Q827570) (← links)
- Randomized Newton-Raphson (Q922640) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
- Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition (Q2009116) (← links)
- A new randomized Gauss-Seidel method for solving linear least-squares problems (Q2021500) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation (Q2027783) (← links)
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching (Q2039235) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- On the regularization effect of stochastic gradient descent applied to least-squares (Q2055514) (← links)
- On the generally randomized extended Gauss-Seidel method (Q2058411) (← links)
- LSPIA, (stochastic) gradient descent, and parameter correction (Q2074869) (← links)
- A new randomized vector algorithm for iterative solution of large linear systems (Q2077060) (← links)
- On relaxed greedy randomized iterative methods for the solution of factorized linear systems (Q2083243) (← links)
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems (Q2085033) (← links)
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method (Q2095163) (← links)
- Randomized Kaczmarz for tensor linear systems (Q2114108) (← links)
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems (Q2116037) (← links)
- A probabilistic generative model for semi-supervised training of coarse-grained surrogates and enforcing physical constraints through virtual observables (Q2124009) (← links)
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems (Q2127524) (← links)
- On greedy randomized average block Kaczmarz method for solving large linear systems (Q2146339) (← 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)
- On the relaxed greedy deterministic row and column iterative methods (Q2161834) (← links)
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces (Q2168686) (← links)
- A sketched finite element method for elliptic models (Q2180458) (← links)
- Rejoinder: ``Nonparametric regression using deep neural networks with ReLU activation function'' (Q2215717) (← links)
- On block Gaussian sketching for the Kaczmarz method (Q2219454) (← links)
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems (Q2230558) (← links)
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations (Q2243348) (← links)
- Projected randomized Kaczmarz methods (Q2297173) (← links)
- Variant of greedy randomized Kaczmarz for ridge regression (Q2311776) (← links)
- Convergence rates for Kaczmarz-type algorithms (Q2413487) (← links)
- A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems (Q2425182) (← links)
- Randomized Kaczmarz with averaging (Q2660609) (← links)
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations (Q2679678) (← links)
- On the convergence analysis of asynchronous SGD for solving consistent linear systems (Q2685380) (← links)
- Randomized block subsampling Kaczmarz-Motzkin method (Q2701041) (← links)
- Extension of an error analysis of the randomized Kaczmarz method for inconsistent linear systems (Q3121406) (← links)
- Accelerating Linear System Solutions Using Randomization Techniques (Q3189664) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- A Randomized Solver for Linear Systems with Exponential Convergence (Q3595400) (← links)
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439) (← links)
- (Q4550484) (← links)
- Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms (Q4598334) (← links)
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems (Q4603512) (← links)
