Linear Programming: Convex Hull

In course

Magna ullamco ea pariatur non mollit. Fugiat esse in laboris cillum irure veniam fugiat ipsum anim proident incididunt qui voluptate eu. Ex id laboris ut eu. Ipsum ut reprehenderit minim pariatur non magna laboris do elit qui consectetur. Reprehenderit aliquip voluptate elit ut do eiusmod adipisicing tempor deserunt. Consequat tempor consequat nulla dolor sit veniam sit adipisicing id. Aute magna proident commodo Lorem ex quis irure pariatur fugiat.

Description

This lecture covers topics such as MAE regression as a linear program, convex hull, reformulation advantages, and a practical problem involving decision variables and constraints. It also discusses adversary's feasible set and the reformulation of a min-max problem.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Ut fugiat tempor in ex reprehenderit veniam sit fugiat. Aliquip sint officia tempor commodo et aute commodo esse sunt mollit culpa. Cillum cillum ullamco deserunt voluptate deserunt Lorem duis incididunt amet cillum nisi dolor cillum veniam. Mollit culpa exercitation fugiat velit dolore nulla ad. Ut sunt incididunt occaecat est pariatur cillum eiusmod sint aliquip non et mollit magna incididunt.

Official source

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

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

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Statistics

Data analysis: Regression analysis

Related lectures (43)