Lecture

Semi-Definite Programming

Description

This lecture covers the concept of semi-definite programming, focusing on optimizing a linear objective function over the intersection of positive semidefinite cone constraints. It also discusses the equivalence of different forms of symmetric matrices and their applications in optimization problems.

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.