Abhijeet Mulgund's Personal Webpage

Search

Search IconIcon to open search

Semidefinite Program

Last updated Nov 1, 2022

# Definition

TODO

%%Suppose $n, m \in \mathbb{N}$, $\mathbf{b}, \mathbf{c} \in \mathbb{R}^{n}$, $A \in \mathbb{R}^{m \times n}$. Then the Constrained Optimization Program

$$\begin{align*} &&\max \mathbf{c}^{T} \mathbf{x}\\ &\text{s.t.}&A \mathbf{x} \leq \mathbf{b}\\ &&\mathbf{x} \geq 0 \end{align*}$$%%