An intermediate dense L-BFGS that applies H with one base-H0 solve and avoids Q/Z recomputation is implemented in PETSc/TAO and beats recursive and compact-dense variants on variable-metric CPU/GPU benchmarks.
Title resolution pending
1 Pith paper cite this work, alongside 49 external citations. Polarity classification is still indexing.
1
Pith paper citing it
49
external citations · OpenAlex
fields
cs.DC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Portable and Versatile Limited-Memory BFGS Implementation in PETSc/TAO
An intermediate dense L-BFGS that applies H with one base-H0 solve and avoids Q/Z recomputation is implemented in PETSc/TAO and beats recursive and compact-dense variants on variable-metric CPU/GPU benchmarks.