Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation

DOI10.1080/10556789608805642zbMath0879.68025OpenAlexW2025245525MaRDI QIDQ4354079

Alan Carle, Ali Bouaricha, Christian H. Bischof, Peyvand M. Khademi

Publication date: 17 December 1997

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789608805642

zbMATH Keywords

automatic differentiationADIFORautomatic differentiation of FORTRAN

Mathematics Subject Classification ID

Theory of software (68N99) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Related Items

Topology optimization in Bernoulli free boundary problems, On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians, TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME, Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization

Uses Software

• ADOL-C
• ADIFOR
• MINPACK-2
• ve08
• Odyssee

Cites Work

• Unnamed Item
• Generalized descent for global optimization
• Automatic differentiation of large sparse systems
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Estimation of Sparse Jacobian Matrices
• Software for estimating sparse Jacobian matrices
• Computing Large Sparse Jacobian Matrices Using Automatic Differentiation