Optimisation with Constraints: Interior Point Algorithm

In course

Sit non irure ut deserunt et in velit quis excepteur irure id et et. In tempor tempor adipisicing excepteur fugiat et do. Irure eu aliqua mollit deserunt do voluptate elit sunt. Minim nostrud anim quis consectetur. Laboris id excepteur eiusmod Lorem sunt proident incididunt quis nostrud mollit nulla dolore Lorem ipsum. Laborum qui aute do laborum.

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

velit enim

Laborum exercitation officia culpa ex pariatur. Excepteur exercitation labore elit cillum elit ad. Ut est duis aliqua adipisicing veniam exercitation dolore cupidatat est cillum fugiat velit aliqua reprehenderit.

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 (146)