DOE OSTI · 1574637
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
Also available from
Abstract
We present a structured quasi-Newton algorithm for unconstrained optimization problems that have unavailable second-order derivatives or Hessian terms. We provide a formal derivation of the well-known Broyden--Fletcher--Goldfarb--Shanno (BFGS) secant update formula that approximates only the missing Hessian terms, and we propose a linesearch quasi-Newton algorithm based on a modification of Wolfe conditions that converges to first-order optimality conditions. We also analyze the local convergence properties of the structured BFGS algorithm and show that it achieves superlinear convergence under the standard assumptions used by quasi-Newton methods using secant updates. In conclusion, we provide a thorough study of the practical performance of the algorithm on the CUTEr suite of test problems and show that our structured BFGS-based quasi-Newton algorithm outperforms the unstructured counterpart(s).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Petra, Cosmin G., Chiang, Naiyuan, Anitescu, Mihai. 2019-04-11. A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information. https://doi.org/10.1137/18m1167942
Cite the original work for its findings. Save a collection to share your selection of sources.