Lecture

Projected Gradient Descent and Quadratic Penalty

In course

Velit sint cupidatat consequat laboris non pariatur quis in anim. Adipisicing aliqua fugiat irure ullamco cillum occaecat incididunt excepteur ipsum voluptate. Ea veniam excepteur cupidatat sint laborum.

Description

This lecture covers Projected Gradient Descent (PGD) and Quadratic Penalty methods, focusing on the assumptions and convergence properties. It explains how PGD works under different conditions and how Quadratic Penalty methods can be used to solve optimization problems. The lecture also discusses the convergence of PGD and the optimality conditions for Quadratic Penalty methods.

Instructor

laborum incididunt eiusmod duis

Sint velit fugiat quis incididunt. Aute ad esse elit dolore reprehenderit reprehenderit dolore anim consequat officia velit dolore. Excepteur anim et amet in tempor amet voluptate laborum nisi duis nisi velit duis.

Official source

https://mediaspace.epfl.ch/media/0_vms2fqv6

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.

Ontological neighbourhood

Mathematics

Topology: General topology

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (39)

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.