Lecture

Constrained optimization: the basics

Description

This lecture covers the basics of constrained optimization, starting with the definition of a tangent direction and the consideration of a set S. The instructor introduces the problem of finding the minimum subject to constraints, illustrating with examples and trust-region subproblems. The lecture progresses to defining the set of acceptable directions and establishing necessary optimality conditions. The concept of a local minimum is explored through theorems and lemmas, leading to the discussion of Taylor expansions and proofs related to local minima.

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.

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.