Lecture

Convex Optimization: Gradient Algorithms

Description

This lecture covers convex optimization problems, the steepest descent algorithm, the Newton method, and the conjugate gradient method. It explains how to find the global minimum of a convex function using gradient-based algorithms and discusses strategies to improve convergence.

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.