Automatic differentiation of algorithms
Publication:1593824
DOI10.1016/S0377-0427(00)00422-2zbMath0994.65020WikidataQ56429730 ScholiaQ56429730MaRDI QIDQ1593824
Steven Brown, Michael Bartholomew-Biggs, Bruce Christianson, L. C. W. Dixon
Publication date: 25 January 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
algorithmoptimal controlnumerical examplesinterval analysisnonlinear optimizationerror analysisparallelismautomatic differentiationpenalty functionsprogram transformationfunction approximationcheckpointsimplicit equationsvariable momentumadjoint programming
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (28)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic computation of derivatives with the use of the multilevel differentiating technique. I: Algorithmic basis
- Using forward accumulation for automatic differentiation of implicitly-defined functions
- Geometric approach to Fletcher's ideal penalty function
- Differential dynamic programming and Newton's method
- Recipes for adjoint code construction
- Reverse aumulation and imploicit functions
- Giving reverse differentiation a helping hand∗
- Cheap Newton steps for optimal control problems: automatic differentiation and Pantoja's algorithm
- A simple automatic derivative evaluation program
- Computational differentiation: techniques, applications, and tools
This page was built for publication: Automatic differentiation of algorithms