Two Algorithms Related to the Method of Steepest Descent
From MaRDI portal
Cited in
(17)- Computational methods of linear algebra
- Characterization of linear stationary iterative processes for solving a singular system of linear equations
- Approximation methods for the unconstrained optimization
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- Quantum relaxed row and column iteration methods based on block-encoding
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Iterative methods for computing generalized inverses related with optimization methods
- Randomized block Kaczmarz method with projection for solving least squares
- Sampled limited memory methods for massive linear inverse problems
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- An iterative method for computing generalized inverses
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Linear discriminant analysis with the randomized Kaczmarz method
- Block-iterative methods for consistent and inconsistent linear equations
- Block Kaczmarz method with inequalities
This page was built for publication: Two Algorithms Related to the Method of Steepest Descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560626)
