Skip to search formSkip to main contentSkip to account menu

Gradient descent

Known as: Descent, Gradient descent optimization, Gradient descent method 
Gradient descent is a first-order iterative optimization algorithm. To find a local minimum of a function using gradient descent, one takes steps… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Recent information theoretic results suggest that precoding on the multi-user downlink MIMO channel with delayed channel state… 
2009
2009
Increasing the expressiveness of qualitative spatial calculi is an essential step towards meeting the requirements of… 
2004
2004
In this article we present a new solution approach for a specific online pickup and delivery problem as it occurs in a real-world… 
1991
1991
The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non… 
Highly Cited
1985
Highly Cited
1985
This paper discusses two algorithms for l_{p}, 1 \leq p \leq 2 , deconvolution. One, iterative reweighted least squares (IRLS… 
1985
1985
Temperature dependence of short‐range order has been systematically studied in two model atomic liquids, using molecular dynamics… 
Highly Cited
1980
Highly Cited
1980
In earlier papers, we have presented motion-compensated television coding schemes in which the displacement of objects was… 
1972
1972
Many structured large scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise…