Approximating large-scale Hessian matrices using secant equations
From MaRDI portal
Cites work
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Approximating sparse Hessian matrices using large-scale linear least squares
- Computing Forward-Difference Intervals for Numerical Optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Estimation of sparse hessian matrices and graph coloring problems
- Evaluating Derivatives
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- scientific article; zbMATH DE number 4135885 (Why is no real title available?)
- scientific article; zbMATH DE number 3898623 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- LAPACK Users' Guide
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- On the Estimation of Sparse Hessian Matrices
- On the limited memory BFGS method for large scale optimization
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Partitioned variable metric updates for large structured optimization problems
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Updating Quasi-Newton Matrices with Limited Storage
This page was built for publication: Approximating large-scale Hessian matrices using secant equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937539)
