Abstract
The exploitation of sparsity forms an important ingredient for the efficient solution of large-scale problems. For this purpose, this paper discusses two algorithms to detect the sparsity pattern of Hessians: An approach for the computation of exact sparsity patterns and a second one for the overestimation of sparsity patterns. For both algorithms, corresponding complexity results are stated. Subsequently, new data structures and set operations are presented yielding a new complexity result together with an alternative implementation of the exact approach. For several test problems, the obtained runtimes confirm the new theoretical result, i.e., a significant reduction in the runtime needed by the exact approach. A comparison with the runtime required for the overestimation of the sparsity pattern is included together with a corresponding discussion. Finally, possible directions for future research are stated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gebremedhin, A., Nguyen, D., Patwary, M., Pothen, A.: Colpack: Software for graph coloring and related problems in scientific computing. Tech. rep., Purdue University (2011)
Gould, N., Orban, D., Toint, P.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373–394 (2003)
Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, 2nd edn. No. 105 in Other Titles in Applied Mathematics. SIAM, Philadelphia, PA (2008). URL http://www.ec-securehost.com/SIAM/OT105.html
Luksan, L., Vlcek, J.: Sparse and partially separable test problems for unconstrained and equality constrained optimization. ICS AS CR V-767, Academy of Sciences of the Czech Republic (1998)
Maurer, H., Mittelmann, H.: Optimization techniques for solving elliptic control problems with control and state constraints. II: Distributed control. Comput. Optim. Appl. 18(2), 141–160 (2001)
Tarjan, R.: Data structures and network algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 44. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1983)
Varnik, E.: Exploitation of structural sparsity in algorithmic differentiation. Ph.D. thesis, RWTH Aachen (2011)
Varnik, E., Razik, L., Mosenkis, V., Naumann, U.: Fast conservative estimation of Hessian sparsity. In: Abstracts of Fifth SIAM Workshop of Combinatorial Scientific Computing, no. 2011-09 in Aachener Informatik Berichte, pp. 18–21. RWTH Aachen (2011)
Wächter, A., Biegler, L.: On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming. Math. Program. 106(1), 25–57 (2006)
Walther, A.: Computing sparse Hessians with automatic differentiation. ACM Transaction on Mathematical Software 34(1), 3:1–3:15 (2008). URL http://doi.acm.org/10.1145/1322436.1322439
Walther, A., Griewank, A.: Getting started with ADOL-C. In: U. Naumann, O. Schenk (eds.) Combinatorial Scientific Computing. Chapman-Hall (2012). see also http://www.coin-or.org/projects/ADOL-C.xml
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walther, A. (2012). On the Efficient Computation of Sparsity Patterns for Hessians. In: Forth, S., Hovland, P., Phipps, E., Utke, J., Walther, A. (eds) Recent Advances in Algorithmic Differentiation. Lecture Notes in Computational Science and Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30023-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-30023-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30022-6
Online ISBN: 978-3-642-30023-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)