Skip to main content Accessibility help
×
Home
Hostname: page-component-55597f9d44-5zjcf Total loading time: 0.321 Render date: 2022-08-14T07:27:56.016Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

3 - Descent Methods

Published online by Cambridge University Press:  31 March 2022

Stephen J. Wright
Affiliation:
University of Wisconsin, Madison
Benjamin Recht
Affiliation:
University of California, Berkeley
Get access

Summary

In this section, we discuss fundamental methods, mostly based on gradient information, that yield descent, that is, the function value decreases at each iteration. We start with the most basic method, the steepest-descent method, analyzing its convergence under different convexity/nonconvexity assumptions on the objective function. We then discuss more general descent methods, based on descent directions other than the negative gradient, showing conditions on the search direction and the steplength that allow convergence results to be proved. We also discuss a method that also makes use of Hessian information, showing that it can find a point satisfying approximate second-order optimality conditions and finding an upper bound on the number of iterations required to do so. We then discuss mirror descent, a class of gradient methods based on more general distance metrics that are particularly useful in optimizing over the unit simplex – a problem that arises often in data science. We conclude by discussing the PL condition, a generalization of the strong convexity condition that allows linear convergence rates to be proved.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2022

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Descent Methods
  • Stephen J. Wright, University of Wisconsin, Madison, Benjamin Recht, University of California, Berkeley
  • Book: Optimization for Data Analysis
  • Online publication: 31 March 2022
  • Chapter DOI: https://doi.org/10.1017/9781009004282.004
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Descent Methods
  • Stephen J. Wright, University of Wisconsin, Madison, Benjamin Recht, University of California, Berkeley
  • Book: Optimization for Data Analysis
  • Online publication: 31 March 2022
  • Chapter DOI: https://doi.org/10.1017/9781009004282.004
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Descent Methods
  • Stephen J. Wright, University of Wisconsin, Madison, Benjamin Recht, University of California, Berkeley
  • Book: Optimization for Data Analysis
  • Online publication: 31 March 2022
  • Chapter DOI: https://doi.org/10.1017/9781009004282.004
Available formats
×