Optimal direct determination of sparse Jacobian matrices

Optimization Methods and Software

Volumn 28, Issue 6, 2013, Pages 1218-1232

  Hossain, Shahadat ^a   Steihaug, Trond ^b  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

graph colouring; independent set; Jacobian matrix; row partitioning

Indexed keywords

AUTOMATIC DIFFERENTIATIONS; COMPUTATIONAL RESULTS; DIRECT DETERMINATION; FINITE DIFFERENCING; GRAPH COLOURING; INDEPENDENT SET; INDEPENDENT VARIABLES; ROW PARTITIONING;

FUNCTION EVALUATION; GRAPH THEORY; OPTIMIZATION;

JACOBIAN MATRICES;

EID: 84886298156     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2012.693927     Document Type: Article

References (31)

1. B.M.Averick, J.J. Moré, C.H. Bischof, A. Carle, and A. Griewank, Computing large sparse Jacobian matrices using automatic differentiation, SIAM J. Sci. Comput. 15(2) (1994), pp. 285-294
2. L. Bergamaschi, I. Moret, and G. Zilli, Inexact Quasi-Newton methods for sparse systems of nonlinear equations, Future Gener. Comp. Syst. 18(1) (2001), pp. 41-53
3. D. Brélaz, New methods to color the vertices of a graph, Commun. ACM 22(4) (1979), pp. 251-256
4. T.F. Coleman, Large Sparse Numerical Optimization, Lecture Notes in Computer Science,Vol. 165, Springer-Verlag, Berlin, 1984
5. T.F. Coleman and J-Y. Cai, The cyclic coloring problem and estimation of sparse Hessian matrices, SIAM J. Alg. Disc. Meth. 7(2) (1986), pp. 221-235
6. T.F. Coleman and J.J. Moré, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal. 20(1) (1983), pp. 187-209
7. T.F. Coleman and J.J. Moré, Estimation of sparse Hessian matrices and graph coloring problems, Math. Prog. 28(1984), pp. 243-270
8. T.F. Coleman and A. Verma, The efficient computation of sparse Jacobian matrices using automatic differentiation, SIAM J. Sci. Comput. 19(4) (1998), pp. 1210-1233
9. G. Corliss, C. Faure, A. Griewank, L. Hascoët, and U. Naumann (eds.), Automatic Differentiation: From Simulation to Optimization, Computer and Information Science. Springer, NewYork, 2002
10. A.R. Curtis, M.J.D. Powell, and J.K. Reid, On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl. 13(1974), pp. 117-119
11. J.E. Dennis, Jr and T. Steihaug, On the successive projections approach to least-squares problems, SIAM J. Numer. Anal. 23(4) (1986), pp. 717-733
12. M.R. Garey and D.S. Johnson, Computers and Intractibility,W.H. Freeman, San Francisco, CA, 1979
13. G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996
14. A. Griewank, Some bounds on the complexity of gradients, Jacobians, and Hessians, in Complexity in Numerical Optimization, P.M. Pardalos, ed.,World Scientific Publishers, River Edge, NJ, 1993, pp. 128-162
15. A. Griewank and C. Mitev, Detecting Jacobian sparsity patterns by Bayesian probing, Math. Prog. 93(1) (2002), pp. 1-25
16. A. Griewank and P.L. Toint, On the unconstrained optimization of partially separable functions, in Nonlinear Optimization 1981, M.J.D. Powell, ed., Academic Press, NewYork, 1982, pp. 301-312
17. A. Griewank and A.Walther, Evaluating Derivatives, Principles and Techniques of Algorithmic Differentiation, 2nd ed., Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2008
18. S. Hossain, CsegGraph: A graph colouring instance generator, Int. J. Comput. Math. 86(10-11) (2009), pp. 1956-1967
19. A.S. Hossain and T. Steihaug, Computing a sparse Jacobian matrix by rows and columns, Optim. Meth. Software 10 (1998), pp. 33-48
20. S. Hossain and T. Steihaug, Reducing the number ofAD passes for computing a sparse Jacobian matrix, inAutomatic Differentiation: From Simulation to Optimization, Chapter 31, G. Corliss, C. Faure, A. Griewank, L. Hascoët, and U. Naumann, eds., Computer and Information Science, Springer, NewYork, 2002, pp. 263-270
21. S. Hossain and T. Steihaug, Sparsity issues in the computation of Jacobian matrices, in Proceedings of the International Symposium on Symbolic and Algebraic Computing (ISSAC), T. Mora, ed., ACM, New York, 2002, pp. 123-130
22. S. Hossain and T. Steihaug, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Discrete Appl. Math. 156(2) (2008), pp. 280-288
23. S. Hossain and T. Steihaug, The CPR method and beyond: Prologue, in Combinatorial Scientific Computing, U. Naumann, O. Schenk, H.D. Simon, and S. Toledo, eds., number 09061 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany, 2009, 3
24. N. Li andY. Saad, MIQR: A multilevel incomplete QR preconditioner for large sparse least-squares problems, SIAM J. Matrix Anal. Appl. 28(2) (2006), pp. 524-550
25. S.T.McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math. Prog. 26 (1983), pp. 153-171
26. J.J. Moré and J. Wu, Optimal sizing for a class of nonlinearly elastic materials, SIAM J. Optim. 7(3) (1997), pp. 814-836
27. G.N. Newsam and J.D. Ramsdell, Estimation of sparse Jacobian matrices, SIAM J. Alg. Disc. Meth. 4(3) (1983), pp. 404-417
28. M.J.D. Powell and P.L. Toint, On the estimation of sparse Hessian matrices, SIAM J. Numer. Anal. 16 (1979), pp. 1060-1074
29. L.B. Rall and T.W. Reps, Algorithmic differencing, in Perspectives on Enclosure Methods, U. Kulisch, R. Lohner, and A. Facius, eds., Springer-Verlag, Vienna, 2001, pp. 133-147
30. Y. Saad, ILUM: A Multi-elimination ILU preconditioner for general sparse matrices, SIAM J. Sci. Comput. 17(4)(1996), pp. 830-847
31. A. Van Gelder, Another look at graph coloring via propositional satisfiability, Discrete Appl. Math. 156 (2008), pp. 230-243