Paperlane

no. 9 · Thursday 5 November 2026

BFGS can converge to non-Clarke-stationary points with positive probability

Lexiao Lai

math.OC · v2 · code · ∎ lean builds · 23 pp

Abstract

We construct a coercive, locally Lipschitz, semialgebraic function on $\mathbb R^2$ for which BFGS with Armijo–Wolfe line search converges to a non-Clarke-stationary point from a nonempty open set of initial points and inverse-Hessian estimates. This disproves the almost-sure stationarity assertion in the 2013 challenge of Lewis and Overton. The construction and proof combine analytical arguments with computer-assisted verification of explicit inequalities.

code
github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 73f5282, checked 2026-11-05 build details
comments
23 pages, 2 figures. Verification code and Lean formalization: https://github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary
fields
Optimization and Control
pdf ↗ page arXiv:2610.34087 ↗