Lecture

Descent methods and line search: Inexact line search

Description

This lecture covers the concept of descent methods and line search, focusing on the idea of updating a point based on a step direction to minimize a function. Examples in one dimension are provided to illustrate the process, along with the intuition that descent direction assumes small steps. The lecture also discusses the importance of maintaining small steps for Taylor's theorem to apply and how even ascent directions can decrease the function with long steps.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.