Lecture

Optimisation with Constraints: Interior Point Algorithm

Description

This lecture covers the optimization with constraints using the Karush-Kuhn-Tucker conditions and the interior point algorithm, focusing on two examples of quadratic programming. The KKT conditions and the Lagrangian are explored to find the optimal solutions.

Instructor

eu non in occaecat

Exercitation et consequat anim irure est. Do quis minim cupidatat nostrud pariatur nostrud consequat. Reprehenderit ut in ullamco exercitation. Ipsum amet voluptate veniam aute incididunt velit elit fugiat eiusmod consequat.

Official source

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

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

Algebra: Equations, Linear algebra, Polynomials

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Information engineering

Artificial intelligence: Automated planning and scheduling

Related lectures (141)

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.