Efficient computation of sparse hessians using coloring and automatic differentiation

INFORMS Journal on Computing

Volumn 21, Issue 2, 2009, Pages 209-223

  Gebremedhin, Assefaw H ^a   Tarafdar, Arijit ^a   Pothen, Alex ^b   Walther, Andrea ^c  

^a ECS Building   (United States)

^b Purdue University   (United States)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Acyclic coloring; Automatic differentiation; Combinatorial scientific computing; Sparse Hessian computation; Star coloring

Indexed keywords

EID: 67649958530     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0286     Document Type: Article

References (20)

1. Brandstädt, A., V. B. Le, J. P. Spinrad. 1999. Graph Classes: A Survey: Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
2. Büskens, C., H. Maurer. 2001. Sensitivity analysis and real-time optimization of parametric nonlinear programming problems. M. Gröschel, S. Krumke, J. Rambau, eds. Online Optimization of Large Scale Systems. Springer, Berlin, 3-16.
3. Coleman, T. F., J. Cai. 1986. The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Algebraic Discrete Methods 7(2) 221-235.
4. Coleman, T. F., J. J. Moré. 1984. Estimation of sparse Hessian matrices and Graph coloring problems. Math. Programming 28 243-270.
5. Dancre, M., P. Tournebise, P. Panciatici, F. Zaoui. 2002. Optimal power flow applied to state estimation enhancement. Proc. 14th Power Systems Comput. Conf., Sevilla, Spain, Paper 3, Session 37.
6. Dixon, L. 1991. Use of automatic differentiation for calculating Hessians and Newton steps. A. Griewank, G. Corliss, eds. Automatic Differentiation of Algorithms: Theory, Implementation, and Application, SIAM, Philadelphia, 114-125.
7. Gay, D. 1996. More AD of nonlinear AMPL models: Computing Hessian information and exploiting partial separability. M. Berz, C. Bischof, G. Corliss, A. Griewank, eds. Computational Differentiation: Techniques, Applications, and Tools. SIAM, Philadelphia, 173-184.
8. Gebremedhin, A. H., F. Manne, A. Pothen. 2005. What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47(4) 629-705.
9. Gebremedhin, A. H., A. Tarafdar, D. Nguyen, A. Pothen. 2009. ColPack: A graph coloring package for supporting sparse derivative matrix computation. ACM Trans. Math. Software. In preparation.
10. Gebremedhin, A. H., A. Tarafdar, F. Manne, A. Pothen. 2007. New acyclic and star coloring algorithms with application to computing Hessians. SIAM J. Sci. Comput. 29 1042-1072.
11. Griewank, A. 2000. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics, Number 19. SIAM, Philadelphia.
12. Griewank, A., D. Juedes, J. Utke. 1996. ADOL-C: A package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Software 22 131-167.
13. Lin, Y., S. S. Skiena. 1995. Algorithms for square roots of graphs. SIAM J. Discrete Math. 8 99-118.
14. Lovász, L. 1972. A characterization of perfect graphs. J. Combin. Theory 13 95-98.
15. McCormick, S. T. 1983. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Programming 26 153-171.
16. Papadimitriou, C. 1976. The NP-completeness of the bandwidth minimization prolem. Computing 16 263-270.
17. Powell, M. J. D., P. L. Toint. 1979. On the estimation of sparse Hessian matrices. SIAM J. Numer. Anal. 16(6) 1060-1074.
18. Vanderbei, R., D. Shanno. 1999. An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13 231-252.
19. Wächter, A., L. Biegler. 2006. On the implementation of an interiorpoint filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1) 25-57.
20. Walther, A. 2008. Computing sparse Hessians with automatic differentiation. ACM Trans. Math. Software 34(1) Paper 3.