Stochastic subspace correction in Hilbert space
From MaRDI portal
Publication:1615986
DOI10.1007/s00365-018-9447-1zbMath1416.65084arXiv1712.02111OpenAlexW2963794676MaRDI QIDQ1615986
Publication date: 31 October 2018
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.02111
convergence ratesonline learningblock coordinate descentgreedyrandomizedsubspace correctioninfinite space splittingmultiplicative Schwarz
Iterative numerical methods for linear systems (65F10) Decomposition methods (49M27) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (3)
Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces ⋮ Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models ⋮ Stochastic subspace correction methods and fault tolerance
Cites Work
- Unnamed Item
- Nonparametric stochastic approximation with large step-sizes
- Greedy and randomized versions of the multiplicative Schwarz method
- Schwarz iterative methods: infinite space splittings
- On the abstract theory of additive and multiplicative Schwarz algorithms
- Approximation and learning by greedy algorithms
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent
- Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
- Greedy Approximation
- Learning Theory
- Stochastic Equations in Infinite Dimensions
- Iterative Methods by Space Decomposition and Subspace Correction
- On the small balls problem for equivalent Gaussian measures
- Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models
- Scattered Data Approximation
This page was built for publication: Stochastic subspace correction in Hilbert space