Gradient descent (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Gradient descent" in English language version.

refsWebsite

Global rank English rank

16doi.org

2^nd place

11wikidata.org

43^rd place

161^st place

7worldcat.org

5^th place

5zbmath.org

1,923^rd place

1,068^th place

5arxiv.org

69^th place

59^th place

4semanticscholar.org

11^th place

8^th place

3web.archive.org

1^st place

3nih.gov

4^th place

2archive.org

6^th place

2ams.org

451^st place

277^th place

1stanford.edu

179^th place

183^rd place

1openlibrary.org

325^th place

255^th place

1uni-bielefeld.de

9,437^th place

low place

1jstor.org

26^th place

20^th place

1researchgate.net

120^th place

125^th place

1wisc.edu

1,045^th place

746^th place

1mit.edu

415^th place

327^th place

1quantamagazine.org

6,413^th place

4,268^th place

1ucla.edu

782^nd place

585^th place

1siam.org

low place

6,473^rd place

1psu.edu

207^th place

136^th place

1willamette.edu

low place

1coursera.org

low place

1tlienart.github.io

low place

ams.org

Haskell B. Curry (1944). "The method of steepest descent for non-linear minimization problems" (PDF). Quarterly of Applied Mathematics. 2 (3): 258–261. doi:10.1090/QAM/10667. ISSN 0033-569X. JSTOR 43633461. MR 0010667. Zbl 0061.26801. Wikidata Q90314523.

mathscinet.ams.org

Haskell B. Curry (1944). "The method of steepest descent for non-linear minimization problems" (PDF). Quarterly of Applied Mathematics. 2 (3): 258–261. doi:10.1090/QAM/10667. ISSN 0033-569X. JSTOR 43633461. MR 0010667. Zbl 0061.26801. Wikidata Q90314523.

archive.org

Saad, Yousef (2003). Iterative methods for sparse linear systems (2nd ed.). Philadelphia, Pa.: Society for Industrial and Applied Mathematics. pp. 195. ISBN 978-0-89871-534-7.
Press, W. H.; Teukolsky, S. A.; Vetterling, W. T.; Flannery, B. P. (1992). Numerical Recipes in C: The Art of Scientific Computing (2nd ed.). New York: Cambridge University Press. ISBN 0-521-43108-5.

arxiv.org

Bernstein, Jeremy; Vahdat, Arash; Yue, Yisong; Liu, Ming-Yu (2020-06-12). "On the distance between two neural networks and the stability of learning". arXiv:2002.03432 [cs.LG].
Bouwmeester, Henricus; Dougherty, Andrew; Knyazev, Andrew V. (2015). "Nonsymmetric Preconditioning for Conjugate Gradient and Steepest Descent Methods". Procedia Computer Science. 51: 276–285. arXiv:1212.6680. doi:10.1016/j.procs.2015.05.241.
Kim, D.; Fessler, J. A. (2016). "Optimized First-order Methods for Smooth Convex Minimization". Mathematical Programming. 151 (1–2): 81–107. arXiv:1406.5468. doi:10.1007/s10107-015-0949-3. PMC 5067109. PMID 27765996. S2CID 207055414.
Drori, Yoel (2017). "The Exact Information-based Complexity of Smooth Convex Minimization". Journal of Complexity. 39: 1–16. arXiv:1606.01424. doi:10.1016/j.jco.2016.11.001. S2CID 205861966.
Combettes, P. L.; Pesquet, J.-C. (2011). "Proximal splitting methods in signal processing". In Bauschke, H. H.; Burachik, R. S.; Combettes, P. L.; Elser, V.; Luke, D. R.; Wolkowicz, H. (eds.). Fixed-Point Algorithms for Inverse Problems in Science and Engineering. New York: Springer. pp. 185–212. arXiv:0912.3522. ISBN 978-1-4419-9568-1.

coursera.org

Geoffrey Hinton; Nitish Srivastava; Kevin Swersky. "The momentum method". Coursera. Retrieved 2 October 2018. Part of a lecture series for the Coursera online course Neural Networks for Machine Learning Archived 2016-12-31 at the Wayback Machine.

doi.org

Stephen P. Boyd; Lieven Vandenberghe (August 2013). Convex Optimization (PDF). Cambridge: Cambridge University Press. doi:10.1017/CBO9780511804441. ISBN 978-0-511-80444-1. OCLC 919495857. OL 51664066M. Wikidata Q58633368.
R. Courant (1 January 1943). "Variational methods for the solution of problems of equilibrium and vibrations" (PDF). Bulletin of the American Mathematical Society. 49 (1): 1–24. doi:10.1090/S0002-9904-1943-07818-4. ISSN 0273-0979. Zbl 0063.00985. Wikidata Q55954196.
Haskell B. Curry (1944). "The method of steepest descent for non-linear minimization problems" (PDF). Quarterly of Applied Mathematics. 2 (3): 258–261. doi:10.1090/QAM/10667. ISSN 0033-569X. JSTOR 43633461. MR 0010667. Zbl 0061.26801. Wikidata Q90314523.
Functional Analysis. Pergamon Press. 1982. doi:10.1016/C2013-0-03044-7. ISBN 9780080230368. Wikidata Q130240253.
JONATHAN BARZILAI; JONATHAN M. BORWEIN (1988). "Two-Point Step Size Gradient Methods" (PDF). IMA Journal of Numerical Analysis. 8 (1): 141–148. doi:10.1093/IMANUM/8.1.141. ISSN 0272-4979. Zbl 0638.65055. Wikidata Q56935973.
Roger Fletcher (2005). On the Barzilai-Borwein Method. pp. 235–256. doi:10.1007/0-387-24255-4_10. ISBN 9780387242545. Wikidata Q130240238. {{cite book}}: |journal= ignored (help)
Philip Wolfe (April 1969). "Convergence Conditions for Ascent Methods". SIAM Review. 11 (2): 226–235. doi:10.1137/1011036. ISSN 0036-1445. Zbl 0177.20603. Wikidata Q56560305.
Bouwmeester, Henricus; Dougherty, Andrew; Knyazev, Andrew V. (2015). "Nonsymmetric Preconditioning for Conjugate Gradient and Steepest Descent Methods". Procedia Computer Science. 51: 276–285. arXiv:1212.6680. doi:10.1016/j.procs.2015.05.241.
I.M. Ross (July 2019). "An optimal control theory for nonlinear optimization". Journal of Computational and Applied Mathematics. 354: 39–51. doi:10.1016/J.CAM.2018.12.044. ISSN 0377-0427. S2CID 127649426. Zbl 1417.49039. Wikidata Q128556931.
Yurii Nesterov (2004). Introductory Lectures on Convex Optimization. doi:10.1007/978-1-4419-8853-9. ISBN 9781461346913. Wikidata Q130240281.
Noel J. Walkington (May 2023). "Nesterov's Method for Convex Optimization". SIAM Review. 65 (2): 539–562. doi:10.1137/21M1390037. ISSN 0036-1445. Wikidata Q130240292.
Kim, D.; Fessler, J. A. (2016). "Optimized First-order Methods for Smooth Convex Minimization". Mathematical Programming. 151 (1–2): 81–107. arXiv:1406.5468. doi:10.1007/s10107-015-0949-3. PMC 5067109. PMID 27765996. S2CID 207055414.
Drori, Yoel (2017). "The Exact Information-based Complexity of Smooth Convex Minimization". Journal of Complexity. 39: 1–16. arXiv:1606.01424. doi:10.1016/j.jco.2016.11.001. S2CID 205861966.
Qian, Ning (January 1999). "On the momentum term in gradient descent learning algorithms". Neural Networks. 12 (1): 145–151. CiteSeerX 10.1.1.57.5612. doi:10.1016/S0893-6080(98)00116-6. PMID 12662723. S2CID 2783597.

dx.doi.org

jstor.org

Haskell B. Curry (1944). "The method of steepest descent for non-linear minimization problems" (PDF). Quarterly of Applied Mathematics. 2 (3): 258–261. doi:10.1090/QAM/10667. ISSN 0033-569X. JSTOR 43633461. MR 0010667. Zbl 0061.26801. Wikidata Q90314523.

mit.edu

dspace.mit.edu

Altschuler, Jason (Jason M. ) (2018). Greed, hedging, and acceleration in convex optimization (Thesis thesis). Massachusetts Institute of Technology.

nih.gov

pubmed.ncbi.nlm.nih.gov

Kim, D.; Fessler, J. A. (2016). "Optimized First-order Methods for Smooth Convex Minimization". Mathematical Programming. 151 (1–2): 81–107. arXiv:1406.5468. doi:10.1007/s10107-015-0949-3. PMC 5067109. PMID 27765996. S2CID 207055414.
Qian, Ning (January 1999). "On the momentum term in gradient descent learning algorithms". Neural Networks. 12 (1): 145–151. CiteSeerX 10.1.1.57.5612. doi:10.1016/S0893-6080(98)00116-6. PMID 12662723. S2CID 2783597.

ncbi.nlm.nih.gov

Kim, D.; Fessler, J. A. (2016). "Optimized First-order Methods for Smooth Convex Minimization". Mathematical Programming. 151 (1–2): 81–107. arXiv:1406.5468. doi:10.1007/s10107-015-0949-3. PMC 5067109. PMID 27765996. S2CID 207055414.

openlibrary.org

Stephen P. Boyd; Lieven Vandenberghe (August 2013). Convex Optimization (PDF). Cambridge: Cambridge University Press. doi:10.1017/CBO9780511804441. ISBN 978-0-511-80444-1. OCLC 919495857. OL 51664066M. Wikidata Q58633368.

psu.edu

citeseerx.ist.psu.edu

Qian, Ning (January 1999). "On the momentum term in gradient descent learning algorithms". Neural Networks. 12 (1): 145–151. CiteSeerX 10.1.1.57.5612. doi:10.1016/S0893-6080(98)00116-6. PMID 12662723. S2CID 2783597.

quantamagazine.org

Parshall, Allison (August 11, 2023). "Risky Giant Steps Can Solve Optimization Problems Faster". Quanta Magazine. Retrieved August 11, 2023.

researchgate.net

Boris Polyak (2010). "Introduction to optimization" (PDF). ResearchGate. Wikidata Q130240203.

semanticscholar.org

api.semanticscholar.org

I.M. Ross (July 2019). "An optimal control theory for nonlinear optimization". Journal of Computational and Applied Mathematics. 354: 39–51. doi:10.1016/J.CAM.2018.12.044. ISSN 0377-0427. S2CID 127649426. Zbl 1417.49039. Wikidata Q128556931.
Kim, D.; Fessler, J. A. (2016). "Optimized First-order Methods for Smooth Convex Minimization". Mathematical Programming. 151 (1–2): 81–107. arXiv:1406.5468. doi:10.1007/s10107-015-0949-3. PMC 5067109. PMID 27765996. S2CID 207055414.
Drori, Yoel (2017). "The Exact Information-based Complexity of Smooth Convex Minimization". Journal of Complexity. 39: 1–16. arXiv:1606.01424. doi:10.1016/j.jco.2016.11.001. S2CID 205861966.
Qian, Ning (January 1999). "On the momentum term in gradient descent learning algorithms". Neural Networks. 12 (1): 145–151. CiteSeerX 10.1.1.57.5612. doi:10.1016/S0893-6080(98)00116-6. PMID 12662723. S2CID 2783597.

siam.org

epubs.siam.org

Noel J. Walkington (May 2023). "Nesterov's Method for Convex Optimization". SIAM Review. 65 (2): 539–562. doi:10.1137/21M1390037. ISSN 0036-1445. Wikidata Q130240292.

stanford.edu

web.stanford.edu

Stephen P. Boyd; Lieven Vandenberghe (August 2013). Convex Optimization (PDF). Cambridge: Cambridge University Press. doi:10.1017/CBO9780511804441. ISBN 978-0-511-80444-1. OCLC 919495857. OL 51664066M. Wikidata Q58633368.

tlienart.github.io

"Mirror descent algorithm".

ucla.edu

seas.ucla.edu

Vandenberghe, Lieven (2019). "Fast Gradient Methods" (PDF). Lecture notes for EE236C at UCLA.

uni-bielefeld.de

math.uni-bielefeld.de

Lemaréchal, C. (2012). "Cauchy and the Gradient Method" (PDF). Doc Math Extra: 251–254. Archived from the original (PDF) on 2018-12-29. Retrieved 2020-01-26.