```markdown
The image presents an example of a family of linear inequalities \( Ax \preceq b + \gamma \Delta b \). The data is chosen to be strictly feasible for \( \gamma > 0 \) and infeasible for \( \gamma \leq 0 \). A basic phase I approach is used, terminating when \( s < 0 \) or the dual objective is positive.

There are two plots:

1. **Top Plot:**
   - **X-axis:** \(\gamma\) ranging from -1 to 1.
   - **Y-axis:** Newton iterations, ranging from 0 to 100.
   - The plot is divided into "Infeasible" (left) and "Feasible" (right) regions, with a vertical line at \(\gamma = 0\).

2. **Bottom Left Plot:**
   - **X-axis:** \(\gamma\) on a logarithmic scale from \(10^0\) to \(10^{-6}\).
   - **Y-axis:** Newton iterations, ranging from 0 to 100.

3. **Bottom Right Plot:**
   - **X-axis:** \(\gamma\) on a logarithmic scale from \(10^{-6}\) to \(10^0\).
   - **Y-axis:** Newton iterations, ranging from 0 to 100.

The number of iterations is roughly proportional to \(\log(1/|\gamma|)\).

The slide is from "A. d'Aspremont. Convex Optimization M2," slide 20/36.
```