Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Hessian chain bracketing

From MaRDI portal
Publication:2699862
Jump to:navigation, search

DOI10.4310/JOC.2023.V14.N4.A7MaRDI QIDQ2699862FDOQ2699862

Uwe Naumann, Shubhaditya Burela

Publication date: 19 April 2023

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.09480




Recommendations

  • Automatic Hessians by reverse accumulation
  • scientific article; zbMATH DE number 992821
  • scientific article
  • Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
  • A new framework for the computation of Hessians


zbMATH Keywords

dynamic programmingNP-completenessHessianalgorithmic differentiationchain rule of differentiation


Mathematics Subject Classification ID

Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Numerical differentiation (65D25)



Cited In (2)

  • Hessian Chain Bracketing
  • A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs





This page was built for publication: Hessian chain bracketing

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2699862&oldid=15549780"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 11:03. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki