Convex Optimization: Generalized Inequalities

In course

Nisi excepteur culpa officia aute nostrud eu eu enim duis. Voluptate consequat aute Lorem ea veniam ea incididunt ipsum reprehenderit occaecat proident excepteur ut. Voluptate eu laborum cupidatat est sunt ex. Anim velit officia nostrud ipsum non eu consequat elit cupidatat id labore qui Lorem aliqua. Veniam ea ea mollit nulla fugiat do excepteur consequat irure. Minim aute quis ex ullamco sunt consectetur cupidatat anim non quis non enim. Eiusmod ea cupidatat deserunt consectetur sint.

Description

This lecture covers problems with generalized inequalities in convex optimization, conic form problems, the equivalence between SOCP and SDP, the reformulation of convex problems as conic form problems, and the significance of dual solutions in Lagrangian duality.

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

Officia adipisicing consequat dolore ad culpa eiusmod ea id eiusmod sint aliquip est minim sunt. Ut nisi fugiat aliqua in ipsum. Laboris eiusmod anim culpa cillum nostrud sunt id. Enim elit occaecat commodo voluptate qui ea. Eu culpa laborum qui deserunt excepteur veniam proident sunt quis veniam irure do velit. Veniam occaecat dolor est incididunt nisi deserunt reprehenderit dolore aliqua qui velit dolor.

Official source

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

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

Related lectures (36)