Compact representations of structured BFGS matrices
From MaRDI portal
Publication:2044571
DOI10.1007/s10589-021-00297-0zbMath1473.90086OpenAlexW3180994935MaRDI QIDQ2044571
Cosmin G. Petra, Johannes J. Brust, Zichao (Wendy) Di, Sven Leyffer
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00297-0
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- Factorized quasi-Newton methods for nonlinear least squares problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- A dense initialization for limited-memory quasi-Newton methods
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
- An Adaptive Nonlinear Least-Squares Algorithm
- Quasi-Newton Methods, Motivation and Theory
- Algorithm 778: L-BFGS-B
- Numerical Optimization
- Line search algorithms with guaranteed sufficient decrease
- A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
- Unconstrained Optimization of Real Functions in Complex Variables
- Multigrid Optimization for Large-Scale Ptychographic Phase Retrieval
- Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization
- CUTEr and SifDec
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- Benchmarking optimization software with performance profiles.
