Non-Convex Optimization

Objective: Minimize $f(x)$ Update Rule: $x_{t+1} = x_t - \eta \nabla f(x_t)$

Initialization ($x_0$): 0

Learning Rate ($\eta$): 0.05

Optimization Steps: 20

Observe the trajectory arrows. Red indicates the path; the Cyan point represents the final converged state $\theta^*$.