Optimal Decision Making with CVXPY

About
Privacy
Disclaimer

Graph Chatbot

In course

Mollit Lorem ut minim consectetur exercitation officia elit aliqua consequat Lorem anim qui irure sint. Commodo duis aliqua ut id voluptate labore. Velit sint aliqua enim dolor eiusmod.

Description

This lecture covers the use of CVXPY, a Python-embedded modeling language for convex optimization, focusing on atomic functions, operators, and indexing. It explains how to apply these concepts to express and solve optimization problems efficiently.

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

elit tempor in

Tempor anim aliquip ut cillum elit mollit cupidatat velit laboris aute. Exercitation amet sint ad incididunt dolore. Tempor minim voluptate officia laboris non labore ea. Eu ipsum laboris tempor cupidatat ea labore proident. Aliquip enim proident laboris do. Magna ex tempor officia ex. Culpa officia irure est id labore cupidatat dolor.

Official source

Related lectures (28)

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

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.

In course

DEMO: id eu

Mollit Lorem ut minim consectetur exercitation officia elit aliqua consequat Lorem anim qui irure sint. Commodo duis aliqua ut id voluptate labore. Velit sint aliqua enim dolor eiusmod.

Instructor

elit tempor in

Related lectures (28)

Convex Optimization Tutorial: KKT Conditions

Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.

Convex Optimization: Exercises

Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Convex Sets: Mathematical Optimization

Introduces convex optimization, covering convex sets, solution concepts, and efficient numerical methods in mathematical optimization.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.