Lecture

Projected Gradient Descent: Quadratic Penalty

Description

This lecture covers the concept of projected gradient descent with a focus on quadratic penalty. It explains the assumptions required for the method, such as non-empty closed sets and Lipschitz continuity. The lecture also discusses the convergence properties of the algorithm and its optimality conditions.

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.