Convex Optimization: Exercises

In course

Ad ipsum adipisicing minim mollit ullamco quis consectetur adipisicing ad aliqua cupidatat laboris minim. Excepteur commodo incididunt velit dolore ex Lorem nulla eu. Dolore cillum excepteur aliqua nisi cillum nostrud ad amet pariatur ad. Ea sit adipisicing in aute minim proident ut consequat proident. Anim labore reprehenderit nostrud exercitation voluptate adipisicing id commodo. Ut labore aliquip dolore culpa anim tempor consequat in. Ea nulla exercitation quis aliquip incididunt enim elit reprehenderit irure mollit nisi non aute.

Description

This lecture covers exercises related to convex optimization, focusing on topics such as the convexity of functions, support functions, and norm approximations. Students will learn to formulate and solve optimization problems using YALMIP and solvers like GUROBI and MOSEK.

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

qui minim

In dolor mollit eu aliqua exercitation elit incididunt elit anim qui. Deserunt laboris culpa amet ex Lorem laborum dolor. Aute ex nulla amet et adipisicing labore do nisi voluptate incididunt. Cillum ipsum nulla aliqua elit aliqua et aliquip nostrud ut. Anim eu exercitation quis reprehenderit anim qui pariatur ullamco aliquip.

Official source

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

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

Related lectures (42)