```markdown
### Image Description

The image is a slide titled "Duality: SOCP example" and presents a Second Order Cone Program (SOCP) and its dual. 

#### Primal Problem
Minimize:
\[ f^T x \]

Subject to:
\[ \|A_i x + b_i\|_2 \leq c_i^T x + d_i, \quad i = 1, \ldots, m \]

Variable:
\[ x \in \mathbb{R}^n \]

#### Dual Problem
Maximize:
\[ \sum_{i=1}^{m} (b_i^T u_i + d_i v_i) \]

Subject to:
\[ \sum_{i=1}^{m} (A_i^T u_i + c_i v_i) + f = 0 \]

\[ \|u_i\|_2 \leq v_i, \quad i = 1, \ldots, m \]

Variables:
\[ u_i \in \mathbb{R}^{n_i}, \quad v_i \in \mathbb{R}, \quad i = 1, \ldots, m \]

Problem data:
\[ f \in \mathbb{R}^n, \quad A_i \in \mathbb{R}^{n_i \times n}, \quad b_i \in \mathbb{R}^{n_i}, \quad c_i \in \mathbb{R}, \quad d_i \in \mathbb{R} \]

The slide is authored by A. d'Aspremont and is part of a convex optimization course, slide 33 of 49.
```