Convexity of Optimization Curves: Local Sharp Thresholds, Robustness Impossibility, and New Counterexamples

We study when the optimization curve of first-order methods -- the sequence f(xn)*n≥0 produced by constant-stepsize iterations -- is convex, equivalently when the forward differences f(xn)-f(x*n+1) are nonincreasing. For gradient descent (GD) on convex L-smooth functions, the curve is convex for all stepsizes η ≤ 1.75/L, and this threshold is tight. Moreover, gradient norms are nonincreasing for all η ≤ 2/L, and in continuous time (gradient flow) the curve is always convex. These results complement and refine the classical smooth convex optimization toolbox, connecting discrete and continuous dynamics as well as worst-case analyses.