{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:37:44Z","timestamp":1776757064037,"version":"3.51.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"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":[[1979,12]]},"DOI":"10.1007\/bf01582093","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:28:41Z","timestamp":1114676921000},"page":"37-62","source":"Crossref","is-referenced-by-count":20,"title":["A PL homotopy for finding all the roots of a polynomial"],"prefix":"10.1007","volume":"16","author":[{"given":"Masakazu","family":"Kojima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisakazu","family":"Nishino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naohiko","family":"Arima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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","volume-title":"A short course in solving equations with PL homotopies","author":"B.C. Eaves","year":"1975","unstructured":"B.C. Eaves, \u201cA short course in solving equations with PL homotopies\u201d, Department of Operations Research, Stanford University, Stanford, CA (1975)."},{"key":"CR3","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":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.1.1.1","volume":"1","author":"B.C. Eaves","year":"1976","unstructured":"B.C. Eaves and H. Scarf, \u201cThe solution of systems of piecewise linear equations\u201d,Mathematics of Operations Research 1 (1976) 1\u201327.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","volume-title":"Applied and computational complex analysis, Vol. 1","author":"P. Henrici","year":"1974","unstructured":"P. Henrici,Applied and computational complex analysis, Vol. 1 (Wiley, New York, 1974)."},{"key":"CR6","unstructured":"C.B. Garcia and W.I. Zangwill, \u201cDetermining all solutions to certain systems of nonlinear equations\u201d, Report 7712, Dept. of Economics and Graduate School of Business, Univ. of Chicago (1977)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/moor.3.1.17","volume":"3","author":"M. Kojima","year":"1978","unstructured":"M. Kojima, \u201cStudies on PL approximation of piecewise-C 1 mappings in fixed points and complementarity theory\u201d,Mathematics of Operations Research 3 (1978) 17\u201336.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/0131053","volume":"31","author":"M. Kojima","year":"1976","unstructured":"M. Kojima, H. Nishino and T. Sekine, \u201cAn extension of Lemke's method to the piecewise linear complementarity problem\u201d,SIAM Journal on Applied Mathematics 31 (1976) 600\u2013613.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1073\/pnas.61.4.1238","volume":"61","author":"H.W. Kuhn","year":"1968","unstructured":"H.W. Kuhn, \u201cSimplicial approximation of fixed points\u201d,Proceedings of National Adacemy of Science 61 (1968) 1238\u20131242.","journal-title":"Proceedings of National Adacemy of Science"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BFb0121246","volume":"1","author":"H.W. Kuhn","year":"1974","unstructured":"H.W. Kuhn, \u201cA new proof of the fundamental theorem of algebra\u201d,Mathematical Programming Studies 1 (1974) 148\u2013158.","journal-title":"Mathematical Programming Studies"},{"key":"CR11","volume-title":"Fixed points: algorithms and applications","author":"H.W. Kuhn","year":"1977","unstructured":"H.W. Kuhn, \u201cFinding roots of polynomials by pivoting\u201d, in: S. Karamardian, ed.,Fixed points: algorithms and applications (Academic Press, New York, 1977)."},{"key":"CR12","volume-title":"Iterative solutions of nonlinear equations in several variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W. Rheinboldt,Iterative solutions of nonlinear equations in several variables (Academic Press, New York, 1970)."},{"key":"CR13","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":"CR14","doi-asserted-by":"crossref","first-page":"809","DOI":"10.2307\/1968861","volume":"41","author":"J.H.C. Whitehead","year":"1940","unstructured":"J.H.C. Whitehead, \u201cOnC 1-complexes\u201d,Annals of Mathematics 41 (1940) 809\u2013824.","journal-title":"Annals of Mathematics"},{"key":"CR15","volume-title":"Applications and extensions of an algorithm that computes fixed points of certain upper semicontinuous 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 semicontinuous point to set mappings\u201d, Ph.D. Thesis, University of Michigan (Michigan, 1972)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582093.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582093\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:45Z","timestamp":1556896545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01582093"],"URL":"https:\/\/doi.org\/10.1007\/bf01582093","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}