```markdown
### Image Description

The slide presents two concepts in convex optimization:

1. **Epigraph Form**:
   - A standard form convex problem is expressed as:
     - **Objective**: Minimize \( t \)
     - **Subject to**:
       - \( f_0(x) - t \leq 0 \)
       - \( f_i(x) \leq 0 \) for \( i = 1, \ldots, m \)
       - \( Ax = b \)

2. **Minimizing Over Some Variables**:
   - An optimization problem is defined as:
     - **Objective**: Minimize \( f_0(x_1, x_2) \)
     - **Subject to**:
       - \( f_i(x_1) \leq 0 \) for \( i = 1, \ldots, m \)
   - This is equivalent to:
     - **Objective**: Minimize \( \tilde{f}_0(x_1) \)
     - **Subject to**:
       - \( f_i(x_1) \leq 0 \) for \( i = 1, \ldots, m \)
   - Where \( \tilde{f}_0(x_1) = \inf_{x_2} f_0(x_1, x_2) \).

The slide is authored by A. d'Aspremont and is from a course on Convex Optimization (slide 46/67).
```