Two Algorithms Related to the Method of Steepest Descent
From MaRDI portal
Publication:5560626
DOI10.1137/0704010zbMath0173.17806OpenAlexW2066157585MaRDI QIDQ5560626
Publication date: 1967
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0704010
Related Items
An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm, Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods, An iterative method for computing generalized inverses, Block Kaczmarz method with inequalities, Computational methods of linear algebra, A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility, On the Meany inequality with applications to convergence analysis of several row-action iteration methods, Randomized block Kaczmarz method with projection for solving least squares, Characterization of linear stationary iterative processes for solving a singular system of linear equations, Iterative methods for computing generalized inverses related with optimization methods, Approximation methods for the unconstrained optimization, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, Block-iterative methods for consistent and inconsistent linear equations, Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations, Sampled limited memory methods for massive linear inverse problems, Quantum relaxed row and column iteration methods based on block-encoding
