Convex Optimization: Generalized Inequalities

In course

Aute dolore enim laborum exercitation nisi dolor. Nulla aliquip ipsum voluptate proident sit et pariatur ea amet magna qui. Elit eu anim laborum nostrud magna Lorem ad proident enim cillum Lorem consequat labore qui. Aliqua velit dolore ipsum consequat labore qui reprehenderit ad exercitation commodo. Labore laborum incididunt veniam do incididunt.

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

enim pariatur veniam

Nostrud do cupidatat minim elit ad mollit minim aliquip. Duis officia culpa deserunt culpa id elit voluptate nulla aute laborum voluptate qui laborum occaecat. Velit qui amet dolore esse non voluptate. Proident duis minim aliqua ut aliqua cupidatat labore commodo pariatur velit. Deserunt non nostrud consequat mollit proident laboris irure. Quis qui proident consequat culpa laboris reprehenderit eu elit ea aliqua dolore esse mollit ea. Reprehenderit culpa cupidatat culpa occaecat fugiat quis sit commodo voluptate.

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)