Limited-Memory BFGS Solver

Motivation

Second-order methods provide fast convergence but require Hessian computation. L-BFGS approximates curvature efficiently using limited memory.

Key Properties

• O(nm) memory complexity
• Superlinear convergence (under assumptions)
• Two-loop recursion implementation
• Wolfe line-search stability