On stochastic block methods for solving nonlinear equations
From MaRDI portal
Cites work
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
- A gradient descent method for solving a system of nonlinear equations
- Coordinate descent algorithms
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Iterative regularization methods for nonlinear ill-posed problems
- Kaczmarz methods for regularizing nonlinear ill-posed equations. I: Convergence analysis
- Nonlinear Kaczmarz algorithms and their convergence
- On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems
- On the convergence of block coordinate descent type methods
- On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems
- Sketched Newton-Raphson
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication: On stochastic block methods for solving nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857863)