Sensitivity information is required by numerous applications such as, for example, optimization algorithms, parameter estimations or real time control. Sensitivities can be computed with working accuracy using the forward mode of automatic differentiation (AD). ADOL-C is an AD-tool for programs written in C or C++. Originally, when applying ADOL-C, tapes for values, operations and locations are written during the function evaluation to generate an internal function representation. Subsequently, these tapes are evaluated to compute the derivatives, sparsity patterns etc., using the forward or reverse mode of AD. The generation of the tapes can be completely avoided by applying the recently implemented tapeless variant of the forward mode for scalar and vector calculations. The tapeless forward mode enables the joint computation of function and derivative values directly from main memory within one sweep. Compared to the original approach shorter runtimes are achieved due to the avoidance of tape handling and a more effective, joint optimization for function and derivative code. Advantages and disadvantages of the tapeless forward mode provided by ADOL-C will be discussed. Furthermore, runtime comparisons for two implemented variants of the tapeless forward mode are presented. The results are based on two numerical examples that require the computation of sensitivity information.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1079,
author = {Andreas Kowarz and Andrea Walther},
title = {Efficient calculation of sensitivities for optimization problems},
journal = {Discussiones Mathematicae, Differential Inclusions, Control and Optimization},
volume = {27},
year = {2007},
pages = {119-134},
zbl = {1152.65417},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1079}
}
Andreas Kowarz; Andrea Walther. Efficient calculation of sensitivities for optimization problems. Discussiones Mathematicae, Differential Inclusions, Control and Optimization, Tome 27 (2007) pp. 119-134. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1079/
[000] [1] M.B. Bell, CppAD: A package for C++ Algorithmic Differentiation, COIN-OR foundation, Available at http://www.coin-or.org/CppAD
[001] [2] C. Bendtsen and O. Stauning, FADBAD, a flexible C++ package for automatic differentiation, Department of Mathematical Modelling, Technical University of Denmark, 1996, Available at http://www.imm.dtu.dk/fadbad.html
[002] [3] J. Dongarra, S. Moore, P. Mucci, K. Seymour, D. Terpstra, Q. Xia and H. You, Performance Application Programming Interface, Innovative Computing Laboratory, Department of Computer Science, University of Tennessee, Available at http://icl.cs.utk.edu/papi
[003] [4] R. Giering and T. Kaminski, Recipes for Adjoint Code Construction, ACM Trans. Math. Software 24 (1998), 437-474. URL: http://www.fastopt.com | Zbl 0934.65027
[004] [5] A. Griewank, A. Kowarz and A. Walther, Documentation of ADOL-C, Available at http://www.math.tu-dresden.de/~adol-c, Updated Version of: A. Griewank, D. Juedes, J. Utke J, ADOL-C: A package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Software 22 (1996), 131-167. | Zbl 0884.65015
[005] [6] A. Griewank A, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Number 19 in Frontiers in Appl. Math. SIAM, Philadelphia, 2000. | Zbl 0958.65028
[006] [7] R. Griesse and A. Walther, Parametric sensitivities for optimal control problems using automatic differentiation, Optimal Control Applications and Methods 24 (2003), 297-314. | Zbl 1073.93518
[007] [8] L. Hascoët and V. Pascual, Tapenade 2.1 user's guide. Tech. rep. 300, INRIA, 2004.
[008] [9] F. Mazzia F and F. Iavernaro, Test Set for Initial Value Problem Solvers, Entire test set description, Department of Mathematics, University of Bari, August 2003, Available at http://www.pitagora.dm.uniba.it/~testset
[009] [10] M. Knauer and C. Büskens, Real-Time Trajectory Planning of the Industrial Robot IRB6400, PAMM. 3 (2003), 515-516.