Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization
From MaRDI portal
Publication:5231665
DOI10.1137/16M1065100zbMath1431.65082OpenAlexW2943853279WikidataQ127904149 ScholiaQ127904149MaRDI QIDQ5231665
Byrd, Richard H., Paul T. Boggs
Publication date: 27 August 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1065100
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
Limited-memory BFGS with displacement aggregation, An overview of stochastic quasi-Newton methods for large-scale machine learning, Compact representations of structured BFGS matrices
Uses Software
Cites Work
- Unnamed Item
- A Modeling Language for Mathematical Programming
- On the limited memory BFGS method for large scale optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- An overview of the Trilinos project
- Updating Quasi-Newton Matrices with Limited Storage
- Quasi-Newton Methods, Motivation and Theory
- CUTE
- Line search algorithms with guaranteed sufficient decrease
- A Limited Memory Algorithm for Bound Constrained Optimization
- Unified Embedded Parallel Finite Element Computations via Software-Based Fréchet Differentiation
- Benchmarking optimization software with performance profiles.