{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:28:00Z","timestamp":1649147280649},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1007\/bf02254851","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T21:33:57Z","timestamp":1132695237000},"page":"63-72","source":"Crossref","is-referenced-by-count":2,"title":["Inverting an interval Hessian of a factorable function"],"prefix":"10.1007","volume":"29","author":[{"given":"F. S.","family":"Sisser","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02254851_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01396702","volume":"34","author":"E. Hansen","year":"1980","unstructured":"Hansen, E.: Global optimization using interval analysis\u2014The multi-dimensional case. Numer. Math.34, 247\u2013270 (1980).","journal-title":"Numer. Math."},{"key":"BF02254851_CR2","unstructured":"Mancini, L. J., McCormick, G. P.: Bounding global minima with interval arithmetic. (To appear in Opns. Res.)"},{"key":"BF02254851_CR3","unstructured":"Sisser, F. S.: An interval termination criterion for minimizing factorable functions. (To be submitted for publication.)"},{"key":"BF02254851_CR4","unstructured":"McCormick, G. P.: A mini-manual for the use of the SUMT computer program and the factorable programming language. Systems Optimization Laboratory, Department of Operations Research, Stanford University, Technical Report SOL-74-15, 1974."},{"key":"BF02254851_CR5","unstructured":"Ghaemi, A., McCormick, G. P.: Symbolic factorable SUMT: What is it? How is it used? Institute for Management Science and Engineering, The George Washington University, Technical Report\u2014Serial T-402, 1979."},{"key":"BF02254851_CR6","doi-asserted-by":"crossref","unstructured":"Sisser, F. S.: Computer-generated interval extensions of factorable functions and their derivatives. International Journal of Computer Mathematics10 (1982), to appear).","DOI":"10.1080\/00207168208803291"},{"key":"BF02254851_CR7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01584542","volume":"2","author":"R. E. Pugh","year":"1972","unstructured":"Pugh, R. E.: A language for nonlinear programming problems. Math. Programming2, 176\u2013206 (1972).","journal-title":"Math. Programming"},{"key":"BF02254851_CR8","doi-asserted-by":"crossref","unstructured":"Sisser, F. S.: A modified Newton's method for minimizing factorable functions. Journal of Optimization Theory and Applications38 (1982, to appear).","DOI":"10.1007\/BF00934483"},{"key":"BF02254851_CR9","first-page":"123","volume-title":"The theory of matrices in numerical analysis","author":"A. S. Householder","year":"1964","unstructured":"Householder, A. S.: The theory of matrices in numerical analysis, p. 123. New York: Blaisdell 1964."},{"key":"BF02254851_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and applications of interval analysis","author":"R. E. Moore","year":"1979","unstructured":"Moore, R. E.: Methods and applications of interval analysis. Philadelphia: SIAM 1979."},{"key":"BF02254851_CR11","first-page":"308","volume":"2","author":"E. Hansen","year":"1965","unstructured":"Hansen, E.: Interval arithmetic in matrix computations, part I. SIAM J. Numer. Anal.2, 308\u2013320 (1965).","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02254851_CR12","volume-title":"Interval analysis","author":"R. E. Moore","year":"1966","unstructured":"Moore, R. E.: Interval analysis. Englewood Cliffs, N.J.: Prentice-Hall 1966."},{"key":"BF02254851_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02234767","volume":"4","author":"R. Krawczyk","year":"1969","unstructured":"Krawczyk, R.: Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing4, 187\u2013201 (1969).","journal-title":"Computing"},{"key":"BF02254851_CR14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/0714040","volume":"14","author":"R. E. Moore","year":"1977","unstructured":"Moore, R. E.: A test for existence of solutions to nonlinear systems. SIAM J. Number. Anal.14, 611\u2013615 (1977).","journal-title":"SIAM J. Number. Anal."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02254851.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02254851\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02254851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T03:54:24Z","timestamp":1586577264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02254851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["BF02254851"],"URL":"https:\/\/doi.org\/10.1007\/bf02254851","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}