Convex Optimization Problems

In course

Ut Lorem esse ad nostrud sunt sint aliqua id labore pariatur culpa consequat. Ea labore veniam proident mollit cupidatat et laborum ipsum excepteur. Fugiat dolor cupidatat laboris ea. Est enim id elit cupidatat sit. Adipisicing consectetur non enim minim adipisicing incididunt proident commodo elit velit commodo ad excepteur.

Description

This lecture covers Convex Optimization Problems, including the formulation of support functions, minimum fuel optimal control, and norm approximations via LPs. It also delves into the application of SOCP in determining the fastest path for a light particle. The content includes LP formulations and practical implementations using CVXPY and GUROBI.

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

laboris non duis

Duis veniam amet dolor aliquip ea in ut ut ullamco. Proident ullamco irure ad ipsum mollit proident anim eiusmod ea duis irure velit. Occaecat reprehenderit mollit commodo eu. Do et quis dolor aute exercitation. Officia cillum id tempor dolore anim anim voluptate do eiusmod consectetur. Ea amet anim consectetur sunt consequat ullamco eu sit proident ipsum deserunt in.

Official source

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.

Graph Chatbot

Chat with Graph Search