{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:54Z","timestamp":1763467974536},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201038"},{"type":"electronic","value":"9783540398165"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39816-5_8","type":"book-chapter","created":{"date-parts":[[2010,6,27]],"date-time":"2010-06-27T22:01:32Z","timestamp":1277676092000},"page":"83-97","source":"Crossref","is-referenced-by-count":4,"title":["Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Naumann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Gottschling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Compilers. Principles, Techniques, and Tools","author":"A. Aho","year":"1986","unstructured":"Aho, A., Sethi, R., Ullman, J.: Compilers. Principles, Techniques, and Tools. Addison- Wesley, Reading (1986)"},{"key":"8_CR2","first-page":"575","volume-title":"Lecture Notes in Computer Science","author":"Andreas Albrecht","year":"2003","unstructured":"Albrecht, A., Gottschling, P., Naumann, U.: Markowitz-type heuristics for computing Jacobian matrices efficiently. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02658, pp. 575\u2013584. Springer, Heidelberg (2003) (to appear)"},{"key":"8_CR3","series-title":"Proceedings Series","volume-title":"Computational Differentiation: Techniques, Applications, and Tools","year":"1996","unstructured":"Berz, M., Bischof, C., Corliss, G., Griewank, A. (eds.): Computational Differentiation: Techniques, Applications, and Tools. Proceedings Series. SIAM, Philadelphia (1996)"},{"volume-title":"Automatic Differentiation of Algorithms \u2013 From Simulation to Optimization","year":"2002","key":"8_CR4","unstructured":"Corliss, G., Faure, C., Griewank, A., Hascoet, L., Naumann, U. (eds.): Automatic Differentiation of Algorithms \u2013 From Simulation to Optimization. Springer, New York (2002)"},{"key":"8_CR5","series-title":"Proceedings Series","volume-title":"Automatic Differentiation: Theory, Implementation, and Application","year":"1991","unstructured":"Corliss, G., Griewank, A. (eds.): Automatic Differentiation: Theory, Implementation, and Application. Proceedings Series. SIAM, Philadelphia (1991)"},{"key":"8_CR6","series-title":"Frontiers in Applied Mathematics","volume-title":"Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation","author":"A. Griewank","year":"2000","unstructured":"Griewank, A.: Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics, vol.\u00a019. SIAM, Philadelphia (2000)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Griewank, A., Reese, S.: On the calculation of Jacobian matrices by the Markovitz rule. In: [5], pp. 126\u2013135 (1991)","DOI":"10.1007\/978-3-0348-7004-7_16"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"Hajek, B.: Cooling schedules for optimal annealing. Mathem. of Operations Research\u00a013, 311\u2013329 (1988)","journal-title":"Mathem. of Operations Research"},{"key":"8_CR9","unstructured":"Herley, K.: A note on the NP-completeness of optimum Jacobian accumulation by vertex elimination. Presentation at: Theory Institute on Combinatorial Challenges in Computational Differentiation (1993)"},{"key":"8_CR10","volume-title":"Simulated Annealing: Theory and Applications","author":"P. Laarhoven Van","year":"1988","unstructured":"Van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. Reidel, Dordrechtz (1988)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys.\u00a021, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"8_CR12","first-page":"320","volume-title":"ALGORITHMY 2000 Conference on Scientific Computing","author":"U. Naumann","year":"2000","unstructured":"Naumann, U.: An enhanced Markowitz rule for accumulating Jacobians efficiently. In: Mikula, K. (ed.) ALGORITHMY 2000 Conference on Scientific Computing, pp. 320\u2013329. Slovak University of Technology, Bratislava (2000)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1137\/S1052623400368394","volume":"13","author":"U. Naumann","year":"2002","unstructured":"Naumann, U.: Cheaper Jacobians by Simulated Annealing. SIAM J. Opt.\u00a013(3), 660\u2013674 (2002)","journal-title":"SIAM J. Opt."},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-1-4613-0075-5_29","volume-title":"Automatic Differentiation of Algorithms","author":"Uwe Naumann","year":"2002","unstructured":"Naumann, U.: Elimination techniques for cheap Jacobians. In: [4], pp. 247\u2013253 (2002)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Naumann, U.: Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph. Mathematical Programming (2003) (to appear)","DOI":"10.1007\/s10107-003-0456-9"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45322-9_9","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"U. Naumann","year":"2001","unstructured":"Naumann, U., Gottschling, P.: Prospects for Simulated Annealing in Automatic Differentiation. In: Steinh\u00f6fel, K. (ed.) SAGA 2001. LNCS, vol.\u00a02264, p. 131. Springer, Heidelberg (2001)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0021-9991(81)90128-5","volume":"43","author":"P.L. Roe","year":"1981","unstructured":"Roe, P.L.: Approximate Riemann solvers, parameter vectors, and difference schemes. Journnal of Computational Physics\u00a043, 357\u2013372 (1981)","journal-title":"Journnal of Computational Physics"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1007\/3-540-46080-2_113","volume-title":"Computational Science - ICCS 2002","author":"M. Tadjouddine","year":"2002","unstructured":"Tadjouddine, M., Forth, S., Pryce, J., Reid, J.: Performance issues for vertex elimination methods in computing Jacobians using Automatic Differentiation. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol.\u00a02330, pp. 1077\u20131086. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39816-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T03:01:25Z","timestamp":1635562885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39816-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201038","9783540398165"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39816-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}