scientific article; zbMATH DE number 1186889

zbMATH Open0908.90233MaRDI QIDQ3840107FDOQ3840107

Authors: Thomas F. Coleman, Arun Verma 

Publication date: 10 August 1998

Title of this publication is not available (Why is that?)

Recommendations

• Efficient detection of Hessian matrix sparsity pattern
• scientific article; zbMATH DE number 992819
• Automatic Hessians by reverse accumulation
• Efficient Automatic Differentiation of Matrix Functions

zbMATH Keywords

sparsitynumerical optimizationautomatic differentiationstructured problems

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (14)

• A new framework for the computation of Hessians
• Automatic Hessians by reverse accumulation
• Computing sparse Hessians with automatic differentiation
• Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
• The hessian in funtion minization
• On efficient Hessian computation using the edge pushing algorithm in Julia
• Efficient calculation of Jacobian and adjoint vector products in the wave propagational inverse problem using automatic differentiation
• Fast calculation of spectral bounds for Hessian matrices on hyperrectangles
• Efficient detection of Hessian matrix sparsity pattern
• Title not available (Why is that?)
• Efficient Calculation of Bounds on Spectra of Hessian Matrices
• Hessian chain bracketing
• Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
• Another way to implement the Powell formula for updating Hessian matrices related to transition structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840107)