Lecture

Optimization Methods

Description

This lecture covers optimization methods without constraints, including gradient and line search in the quadratic case. It discusses the concepts of Lipschitz continuity, convexity, and the Wolfe conditions. The instructor explains the gradient method with constant step and the importance of convergence in optimization.

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.