Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the main idea behind descent methods and line search, focusing on the generation of intervals, symmetric reduction, and the calculation of the golden section. The instructor explains the assumptions, unidimensional functions, and the process of generating the next interval using different cases. The lecture also delves into the symmetric reduction technique and the recycling of function evaluations. The calculation of the golden section parameter 'p' is detailed, emphasizing the iterative process and the mathematical operations involved.