{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:23:47Z","timestamp":1648970627239},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"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":[[1980,12]]},"DOI":"10.1007\/bf01588323","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T16:15:32Z","timestamp":1114704932000},"page":"274-285","source":"Crossref","is-referenced-by-count":19,"title":["An improvement of fixed point algorithms by using a good triangulation"],"prefix":"10.1007","volume":"18","author":[{"given":"G.","family":"van der Laan","sequence":"first","affiliation":[]},{"given":"A. J. J.","family":"Talman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584975","volume":"3","author":"B.C. Eaves","year":"1972","unstructured":"B.C. Eaves, \u201cHomotopies for computation of fixed points\u201d,Mathematical Programming 3 (1972) 1\u201322.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01584991","volume":"3","author":"B.C. Eaves","year":"1972","unstructured":"B.C. Eaves and R. Saigal, \u201cHomotopies for computation of fixed points on unbounded regions\u201d,Mathematical Programming 3 (1972) 225\u2013237.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0713041","volume":"13","author":"R. Kellogg","year":"1976","unstructured":"R. Kellogg, T.Y. Li and J. Yorke, \u201cA constructive proof of Brouwer fixed point theorem and computation results\u201d,SIAM Journal of Numerical Mathematics 13 (1976) 473\u2013483.","journal-title":"SIAM Journal of Numerical Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1147\/rd.45.0518","volume":"4","author":"H.W. Kuhn","year":"1960","unstructured":"H.W. Kuhn, \u201cSome combinatorial lemmas in topology\u201d,IBM Journal of Research and Development 4 (1960) 518\u2013524.","journal-title":"IBM Journal of Research and Development"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00933874","volume":"17","author":"H.W. Kuhn","year":"1975","unstructured":"H.W. Kuhn and J.G. MacKinnon, \u201cSandwich method for finding fixed points\u201d,Journal of Optimization Theory and Applications 17 (1975) 189\u2013204.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF01588226","volume":"17","author":"G. Laan van der","year":"1979","unstructured":"G. van der Laan and A.J.J. Talman, \u201cA restart algorithm for computing fixed points without an extra dimension\u201d,Mathematical Programming 17 (1979) 74\u201384.","journal-title":"Mathematical Programming"},{"key":"CR7","volume-title":"Functional differential equation and approximation of fixed points","author":"G. Laan van der","year":"1979","unstructured":"G. van der Laan and A.J.J. Talman, \u201cA restart algorithm without an artificial level for computing fixed points on unbounded regions\u201d in: H.O. Peitgen and H.O. Walther, eds.,Functional differential equation and approximation of fixed points (Springer, Berlin, 1979)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"G. van der Laan and A.J.J. Talman, \u201cA new subdivision for computing fixed points with a homotopy algorithm\u201d,Mathematical Programming, to appear.","DOI":"10.1007\/BF01581629"},{"key":"CR9","volume-title":"Triangulations of a cube","author":"P.S. Mara","year":"1972","unstructured":"P.S. Mara, \u201cTriangulations of a cube\u201d, M.S. Thesis, Colorado State University (Fort Collins, CO, 1972)."},{"key":"CR10","volume-title":"Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings","author":"O.H. Merrill","year":"1972","unstructured":"O.H. Merrill, \u201cApplications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings\u201d, Ph.D. Thesis, University of Michigan (Ann Arbor, MI, 1972)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/B978-0-12-398050-2.50017-7","volume-title":"Fixed points: algorithms and applications","author":"R. Saigal","year":"1977","unstructured":"R. Saigal, \u201cInvestigations into the efficiency of the fixed point algorithms\u201d, in: S. Karamardian, ed.,Fixed points: algorithms and applications (Academic Press, New York, 1977) pp. 203\u2013223."},{"key":"CR12","unstructured":"R. Saigal, D. Solow and L. Wolsey, \u201cA comparative study of two algorithms that compute fixed points in unbounded regions\u201d, VIII International Symposium on Mathematical Programming (Stanford University, August 1973)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H.E. Scarf","year":"1967","unstructured":"H.E. Scarf, \u201cThe approximation of fixed points of a continuous mapping\u201d,SIAM Journal on Applied Mathematics 15 (1967) 1328\u20131343.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR14","volume-title":"The computation of economic equilibria","author":"H.E. Scarf","year":"1973","unstructured":"H.E. Scarf (with the collaboration of T. Hansen),The computation of economic equilibria (Yale University Press, New Haven, CT, 1973)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BF01580679","volume":"10","author":"M.J. Todd","year":"1976","unstructured":"M.J. Todd, \u201cOn triangulations for computing fixed points\u201d,Mathematical Programming 10 (1976) 322\u2013346.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0120788","volume":"7","author":"M.J. Todd","year":"1978","unstructured":"M.J. Todd, \u201cImproving the convergence of fixed point algorithms\u201d,Mathematical Programming Study 7 (1978) 151\u2013169.","journal-title":"Mathematical Programming Study"},{"key":"CR17","volume-title":"\u201cFixed-point algorithms that allow restarting without an extra dimension\u201d, Technical Report No. 379","author":"M.J. Todd","year":"1978","unstructured":"M.J. Todd, \u201cFixed-point algorithms that allow restarting without an extra dimension\u201d, Technical Report No. 379, Cornell University (Ithaca, NY, 1978)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588323\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:36:22Z","timestamp":1556883382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["BF01588323"],"URL":"https:\/\/doi.org\/10.1007\/bf01588323","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}