```markdown
## Examples

### Second-order Cone Program 
- **Description**: 50 variables, 50 SOC constraints in \(\mathbb{R}^6\).
- **Graphs**:
  - **Left**: Duality gap vs. Newton iterations.
    - Logarithmic scale for duality gap (ranging from \(10^2\) to \(10^{-6}\)).
    - Different lines for \(\mu = 50\), \(\mu = 200\), and \(\mu = 2\).
  - **Right**: Newton iterations vs. \(\mu\).
    - Iterations range from 0 to 120.

### Semidefinite Program
- **Description**: 100 variables, LMI constraint in \(S^{100}\).
- **Graphs**:
  - **Left**: Duality gap vs. Newton iterations.
    - Logarithmic scale for duality gap (ranging from \(10^2\) to \(10^{-6}\)).
    - Different lines for \(\mu = 150\), \(\mu = 50\), and \(\mu = 2\).
  - **Right**: Newton iterations vs. \(\mu\).
    - Iterations range from 0 to 140.

*Source: A. d'Aspremont. Convex Optimization M2.*
```
