A note on direct methods for approximations of sparse Hessian matrices

DOI10.21136/am.1988.104300zbMath0658.65058OpenAlexW2727913682MaRDI QIDQ3806696

Miroslav Tůma

Publication date: 1988

Full work available at URL: https://eudml.org/doc/15535

zbMATH Keywords

numerical examplesfinite-differenceslarge sparse optimizationgraph-coloringsparse Hessian matricesordering schemecoloring scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Numerical differentiation (65D25)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
• Estimation of sparse hessian matrices and graph coloring problems
• Smallest-last ordering and clustering and graph coloring algorithms
• On the Estimation of Sparse Hessian Matrices
• A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem

This page was built for publication: A note on direct methods for approximations of sparse Hessian matrices