Papers › QN Optimization with Hessian Sample
QN Optimization with Hessian Sample
Joy Azzam, Daniel Henderson, Benjamin Ong, Allan Struthers
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This article explores how to effectively incorporate curvature information generated using SIMD-parallel forward-mode Algorithmic Differentiation (AD) into unconstrained Quasi-Newton (QN) minimization of a smooth objective function, f. Specifically, forward-mode AD can be used to generate block Hessian samples Y=∇² f(x) S whenever the gradient is evaluated. Block QN algorithms then update approximate inverse Hessians, Hₖ ≈∇² f(xₖ), with these Hessian samples. Whereas standard line-search based BFGS algorithms carefully filter and correct secant-based approximate curvature information to maintain positive definite approximations, our algorithms directly incorporate Hessian samples to update indefinite inverse Hessian approximations without filtering. The sampled directions supplement the standard QN two-dimensional trust-region sub-problem to generate a moderate dimensional subproblem which can exploit negative curvature. The resulting quadratically-constrained quadratic program is solved accurately with a generalized eigenvalue algorithm and the step advanced using standard trust region step acceptance and radius adjustments. The article aims to avoid serial bottlenecks, exploit accurate positive and negative curvature information, and conduct a preliminary evaluation of selection strategies for S.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections