Gradient Descent for Convex Functions

Sven A. Wegner ()

Chapter Chapter 17 in Mathematical Introduction to Data Science, 2024, pp 261-280 from Springer

Abstract: Abstract In the last chapter, we provide an introduction to the gradient descent method, which is used in many data science and machine learning problems. In addition to classic results on the convergence of the method for μ-convex and L-smooth functions, we also discuss the case where the function to be minimized is merely convex and differentiable.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-69426-8_17

Ordering information: This item can be ordered from
http://www.springer.com/9783662694268

DOI: 10.1007/978-3-662-69426-8_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().