Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Compact representations of structured BFGS matrices

Journal Article · · Computational Optimization and Applications
 [1];  [1];  [1];  [2]
  1. Argonne National Lab. (ANL), Argonne, IL (United States)
  2. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
For general large-scale optimization problems compact representations exist in which recursive quasi-Newton update formulas are represented as compact matrix factorizations. For problems in which the objective function contains additional structure, recent structured quasi-Newton methods exploit available second-derivative information and approximate unavailable second derivatives. Here, this article develops the compact representations of two structured Broyden-Fletcher-Goldfarb-Shanno update formulas. The compact representations enable efficient limited memory and initialization strategies. Two limited memory line search algorithms are described for which extensive numerical results demonstrate the efficacy of the algorithms, including comparisons to IPOPT on large machine learning problems, and to L-BFGS on a real world large scale ptychographic imaging application.
Research Organization:
Argonne National Laboratory (ANL), Argonne, IL (United States); Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
Grant/Contract Number:
AC02-06CH11357; AC52-07NA27344
OSTI ID:
1824771
Alternate ID(s):
OSTI ID: 1863253
Report Number(s):
LLNL-JRNL--819824; 1031027
Journal Information:
Computational Optimization and Applications, Journal Name: Computational Optimization and Applications Journal Issue: 1 Vol. 80; ISSN 0926-6003
Publisher:
SpringerCopyright Statement
Country of Publication:
United States
Language:
English

References (25)

Convergence theory for the structured BFGS secant method with an application to nonlinear least squares journal May 1989
Representations of quasi-Newton matrices and their use in limited memory methods journal January 1994
Factorized quasi-Newton methods for nonlinear least squares problems journal July 1991
Numerical Optimization book January 1999
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming journal April 2005
Benchmarking optimization software with performance profiles journal January 2002
A dense initialization for limited-memory quasi-Newton methods journal May 2019
A complex gradient operator and its application in adaptive array theory journal January 1983
A family of variable-metric methods derived by variational means journal January 1970
Conditioning of quasi-Newton methods for function minimization journal September 1970
Updating quasi-Newton matrices with limited storage journal September 1980
A new approach to variable metric algorithms journal March 1970
The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations journal January 1970
Two-Point Step Size Gradient Methods journal January 1988
On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning journal July 2011
Quasi-Newton Methods, Motivation and Theory journal January 1977
Unconstrained Optimization of Real Functions in Complex Variables journal January 2012
Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization journal January 2019
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information journal January 2019
Multigrid Optimization for Large-Scale Ptychographic Phase Retrieval journal January 2020
Line search algorithms with guaranteed sufficient decrease journal September 1994
LIBSVM: A library for support vector machines journal April 2011
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization journal December 1997
An Adaptive Nonlinear Least-Squares Algorithm journal September 1981
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited journal December 2003

Similar Records

A STRUCTURED QUASI-NEWTON ALGORITHM FOR OPTIMIZING WITH INCOMPLETE HESSIAN INFORMATION
Journal Article · Mon Dec 31 23:00:00 EST 2018 · SIAM Journal on Optimization · OSTI ID:1573037

A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
Journal Article · Wed Apr 10 20:00:00 EDT 2019 · SIAM Journal on Optimization · OSTI ID:1574637