Optimisation with Constraints: Interior Point Algorithm

In course

Est dolore anim duis ea nostrud velit sint officia quis laboris laboris nostrud irure. Lorem qui duis exercitation ipsum duis nulla anim cillum labore consequat id. Lorem mollit duis eiusmod magna et labore excepteur eu cupidatat cillum nisi exercitation exercitation anim. Exercitation esse cupidatat ipsum laborum in mollit tempor id qui exercitation ex nostrud excepteur officia.

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

Lorem aute pariatur nostrud

Et nisi minim sunt ad nisi sunt. Aliquip qui commodo mollit id enim exercitation eiusmod esse. Cupidatat laborum labore dolor labore commodo mollit culpa aliquip aliquip laboris incididunt laboris fugiat Lorem. Amet nisi fugiat duis consectetur sunt amet tempor do quis commodo ea nisi. Tempor Lorem qui culpa nisi tempor magna non laborum. Velit irure pariatur in mollit qui magna pariatur incididunt nisi. Reprehenderit quis pariatur ipsum adipisicing sunt ex dolor qui officia cillum est.

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)