Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

quasi-Newton method

A second-order method that builds an approximate Hessian from gradient changes alone, instead of computing the true one.

A quasi-Newton method approximates Newton's method's curvature information without ever forming the true Hessian H^{(k)}. Each iteration updates an approximation B^{(k)} to the INVERSE Hessian using only the gradient change y_k=\nabla f(x^{(k+1)})-\nabla f(x^{(k)}) and the step already taken s_k=x^{(k+1)}-x^{(k)}, then steps as x^{(k+1)}=x^{(k)}-\alpha_k B^{(k)}\nabla f(x^{(k)}). BFGS and DFP are the two classic update rules for B^{(k)} — both recover Newton-like curvature purely from gradients already computed, at the cost of needing a few iterations before B^{(k)} is a good approximation.

Read the full section →
Graph settings

Calculator