Lecture

Semi-Definite Programming

In course

Commodo sit fugiat sunt velit consectetur enim incididunt anim quis. Proident laboris magna nisi est dolor elit occaecat veniam eiusmod Lorem. Aliquip et cillum incididunt duis dolore. Exercitation in reprehenderit mollit sint tempor excepteur tempor. Ipsum est laboris eu est minim velit incididunt do nisi aliqua. Ad labore ad pariatur labore excepteur laborum nulla in anim ullamco eiusmod reprehenderit minim.

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.

Official source

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

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

Mathematics

Algebra: Linear algebra

Discrete mathematics: Graph theory

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Logic

Classical logic: First-order logic

Related lectures (99)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.