{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T19:14:49Z","timestamp":1782242089499,"version":"3.54.5"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1007\/bf02612334","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T02:50:56Z","timestamp":1177642256000},"page":"243-270","source":"Crossref","is-referenced-by-count":92,"title":["Estimation of sparse hessian matrices and graph coloring problems"],"prefix":"10.1007","volume":"28","author":[{"given":"Thomas F.","family":"Coleman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorge J.","family":"Mor\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02612334_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"T.F. Coleman","year":"1983","unstructured":"T.F. Coleman and J.J. Mor\u00e9, \u201cEstimation of sparse Jacobian matrices and graph coloring problems\u201d,SIAM Journal on Numerical Analysis 20 (1983), 187\u2013209.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"BF02612334_CR2","series-title":"Technical Report ANL-82-37","volume-title":"Software for estimating sparse Jacobian matrices","author":"T.F. Coleman","year":"1982","unstructured":"T.F. Coleman and J.J. Mor\u00e9, \u201cSoftware for estimating sparse Jacobian matrices\u201d, Technical Report ANL-82-37, Argonne National Laboratory (Argonne, Illinois, 1982)."},{"key":"BF02612334_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/imamat\/13.1.117","volume":"13","author":"A.R. Curtis","year":"1974","unstructured":"A.R. Curtis, M.J.D. Powell and J.K. Reid, \u201cOn the estimation of sparse Jacobian matrices\u201d,Journal of the Institute of Mathematics and its Applications 13 (1974) 117\u2013119.","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"BF02612334_CR4","unstructured":"S. Eisenstat, Personal communication (1980)."},{"key":"BF02612334_CR5","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1002\/nme.1620140606","volume":"14","author":"G.C. Everstine","year":"1979","unstructured":"G.C. Everstine, \u201cA comparison of three resequencing algorithms for the reduction of matrix profile and wavefront\u201d,International Journal on Numerical Methods in Engineering 14 (1979) 837\u2013853.","journal-title":"International Journal on Numerical Methods in Engineering"},{"key":"BF02612334_CR6","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability (W.H. Freeman, San Francisco, CA, 1979)."},{"key":"BF02612334_CR7","first-page":"104","volume-title":"Graph theory and computing","author":"D.W. Matula","year":"1972","unstructured":"D.W. Matula, G. Marble and J.D. Isaacson, \u201cGraph coloring algorithms\u201d, in: R. Read, ed.,Graph theory and computing (Academic Press, New York, 1972), pp. 104\u2013122."},{"key":"BF02612334_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D.W. Matula","year":"1983","unstructured":"D.W. Matula and L.L. Beck, \u201cSmallest-last ordering and clustering and graph coloring algorithms\u201d,Journal of the Association for Computing Machinery 30 (1983) 417\u2013427.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02612334_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S.T. McCormick","year":"1983","unstructured":"S.T. McCormick, \u201cOptimal approximation of sparse Hessians and its equivalence to a graph coloring problem\u201d,Mathematical Programming 26 (1983), 153\u2013171.","journal-title":"Mathematical Programming"},{"key":"BF02612334_CR10","doi-asserted-by":"crossref","unstructured":"G.N. Newsam and J.D. Ramsdell, \u201cEstimation of sparse Jacobian matrices\u201d,SIAM Journal of Algebraic and Discrete Methods (1983), to appear.","DOI":"10.1137\/0604041"},{"key":"BF02612334_CR11","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1137\/0716078","volume":"16","author":"M.J.D. Powell","year":"1979","unstructured":"M.J.D. Powell and Ph.L. Toint, \u201cOn the estimation of sparse Hessian matrices\u201d,SIAM Journal on Numerical Analysis 16 (1979) 1060\u20131074.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"BF02612334_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(68)80081-X","volume":"4","author":"G. Szekeres","year":"1968","unstructured":"G. Szekeres and H.S. Wilf, \u201cAn inequality for the chromatic number of a graph\u201d,Journal of Combinatorial Theory 4 (1968) 1\u20133.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF02612334_CR13","series-title":"Technical Report SOL 82-8","volume-title":"Optimization of unconstrained functions with sparse Hessian matrices: Newton-type methods","author":"M.N. Thapa","year":"1982","unstructured":"M.N. Thapa, \u201cOptimization of unconstrained functions with sparse Hessian matrices: Newton-type methods\u201d, Technical Report SOL 82-8, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1982)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612334.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02612334\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:34:25Z","timestamp":1558326865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02612334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF02612334"],"URL":"https:\/\/doi.org\/10.1007\/bf02612334","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}