{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:11Z","timestamp":1759638551867},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"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":[[1987,7]]},"DOI":"10.1007\/bf02591848","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:40:12Z","timestamp":1175182812000},"page":"1-15","source":"Crossref","is-referenced-by-count":15,"title":["Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds"],"prefix":"10.1007","volume":"38","author":[{"given":"G.","family":"van der Laan","sequence":"first","affiliation":[]},{"given":"A. J. J.","family":"Talman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02591848_CR1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/1022003","volume":"22","author":"E.L. Allgower","year":"1980","unstructured":"E.L. Allgower and K. Georg, \u201cSimplicial and continuation methods for approximating fixed points and solutions to systems of equations,\u201dSIAM Review 22 (1980) 28\u201385.","journal-title":"SIAM Review"},{"key":"BF02591848_CR2","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1090\/S0025-5718-1978-0492046-9","volume":"32","author":"S.N. Chow","year":"1978","unstructured":"S.N. Chow, J. Mallet-Paret and J.A. Yorke, \u201cFinding zeroes of maps: homotopy methods that are constructive with probability one,\u201dMathematics of Computation 32 (1978) 887\u2013899.","journal-title":"Mathematics of Computation"},{"key":"BF02591848_CR3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/BF01584073","volume":"1","author":"B.C. Eaves","year":"1971","unstructured":"B.C. Eaves, \u201cOn the basic theory of complementarity,\u201dMathematical Programming 1 (1971) 68\u201375.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580246","volume":"6","author":"M.L. Fisher","year":"1974","unstructured":"M.L. Fisher and F.J. Gould, \u201cA simplicial algorithm for the nonlinear complementarity problem,\u201dMathematical Programming 6 (1974) 281\u2013300.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR5","volume-title":"The complementarity problem and its applications","author":"C.B. Garcia","year":"1973","unstructured":"C.B. Garcia, \u201cThe complementarity problem and its applications,\u201d Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, NY (1973)."},{"key":"BF02591848_CR6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/0316033","volume":"16","author":"G.J. Habetler","year":"1978","unstructured":"G.J. Habetler and K.M. Kostreva, \u201cOn a direct algorithm for nonlinear complementarity problems,\u201dSIAM Journal of Control and Optimization 16 (1978) 504\u2013511.","journal-title":"SIAM Journal of Control and Optimization"},{"key":"BF02591848_CR7","series-title":"Keio Engineering Reports","volume-title":"Computational methods for solving the nonlinear complementarity problem","author":"M. Kojima","year":"1974","unstructured":"M. Kojima, \u201cComputational methods for solving the nonlinear complementarity problem\u201d, Keio Engineering Reports 27, Keio University, Yokohama, Japan (1974)."},{"key":"BF02591848_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF01584240","volume":"21","author":"M. Kojima","year":"1981","unstructured":"M. Kojima and R. Saigal, \u201cOn the number of solutions to a class of complementarity problems,\u201dMathematical Programming 21 (1981) 190\u2013203.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01585103","volume":"24","author":"M. Kojima","year":"1982","unstructured":"M. Kojima and Y. Yamamoto, \u201cVariable dimension algorithms: Basic theory, interpretations and extensions of some existing methods,\u201dMathematical Programming 24 (1982) 177\u2013215.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR10","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/BF02612336","volume":"28","author":"M. Kojima","year":"1984","unstructured":"M. Kojima and Y. Yamamoto, \u201cA unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm,\u201dMathematical Programming 28 (1984) 288\u2013328.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR11","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,\u201dMathematical Programming 17 (1979) 74\u201384.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01589331","volume":"20","author":"G. Laan van der","year":"1981","unstructured":"G. van der Laan and A.J.J. Talman, \u201cA class of simplicial restart fixed point algorithms without an extra dimension,\u201dMathematical Programming 20 (1981) 33\u201348.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF00938483","volume":"50","author":"G. Laan van der","year":"1986","unstructured":"G. van der Laan and A.J.J. Talman, \u201cSimplicial algorithms for finding stationary points, a unifying description,\u201dJournal of Optimization Theory and Applications 50 (1986) 165\u2013182.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02591848_CR14","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF01681351","volume":"9","author":"H.J. L\u00fcthi","year":"1975","unstructured":"H.J. L\u00fcthi, \u201cA simplicial approximation of a solution for the nonlinear complementarity problem,\u201dMathematical Programming 9 (1975) 278\u2013293.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/0131009","volume":"31","author":"O.L. Mangasarian","year":"1976","unstructured":"O.L. Mangasarian, \u201cEquivalence of the complementarity problem to a system of nonlinear equations,\u201dSIAM Journal of Applied Mathematics 31 (1976) 89\u201392.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"BF02591848_CR16","volume-title":"Applications and extensionof 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 extensionof an algorithm that computes fixed points of certain upper semi-continuous point-to-set mappings\u201d Ph.D. Thesis, University of Michigan, Ann Arbor, Mich. (1972)."},{"key":"BF02591848_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1016001","volume":"16","author":"J.J. Mor\u00e9","year":"1974","unstructured":"J.J. Mor\u00e9, \u201cCoercivity conditions in nonlinear complementarity algorithms\u201d,SIAM Review 16 (1974) 1\u201315.","journal-title":"SIAM Review"},{"key":"BF02591848_CR18","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1287\/moor.8.4.557","volume":"8","author":"R. Saigal","year":"1983","unstructured":"R. Saigal, \u201cA homotopy for solving large, sparse and structured fixed point problems\u201d,Mathematics of Operations Research 8 (1983) 557\u2013578.","journal-title":"Mathematics of Operations Research"},{"key":"BF02591848_CR19","series-title":"Mathematical Centre Tracts","volume-title":"Variable dimension fixed point algorithms and triangulations","author":"A.J.J. Talman","year":"1980","unstructured":"A.J.J. Talman, \u201cVariable dimension fixed point algorithms and triangulations,\u201d Mathematical Centre Tracts, 128 (Mathematisch Centrum, Amsterdam, 1980)."},{"key":"BF02591848_CR20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-1-4613-3572-6_15","volume-title":"Homotopy Methods and Global Convergence","author":"A.J.J. Talman","year":"1983","unstructured":"A.J.J. Talman and L. Van der Heyden, \u201cAlgorithms for the linear complementarity problem which allow an arbitrary starting point,\u201d in: B.C. Eaves et al., eds.Homotopy Methods and Global Convergence (Plenum Press, New York, 1983) pp. 267\u2013286."},{"key":"BF02591848_CR21","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":"BF02591848_CR22","first-page":"43","volume-title":"Numerical Solution of Highly Nonlinear Problems","author":"M.J. Todd","year":"1980","unstructured":"M.J. Todd, \u201cGlobal and local convergence and monotonicity results for a recent variable dimension simplicial algorithm,\u201d in W. Forster, ed.,Numerical Solution of Highly Nonlinear Problems (North-Holland, Amsterdam, 1980) pp. 43\u201369."},{"key":"BF02591848_CR23","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0317004","volume":"17","author":"L.T. Watson","year":"1979","unstructured":"L.T. Watson, \u201cSolving the nonlinear complementarity problem by a homotopy method,\u201dSIAM Journal of Control and Optimization 17 (1979) 36\u201346.","journal-title":"SIAM Journal of Control and Optimization"},{"key":"BF02591848_CR24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01584229","volume":"21","author":"A.H. Wright","year":"1981","unstructured":"A.H. Wright, \u201cThe octahedral algorithm, a new simplicial fixed point algorithm\u201d,Mathematical Programming 21 (1981) 47\u20139.","journal-title":"Mathematical Programming"},{"key":"BF02591848_CR25","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02594783","volume":"25","author":"Y. Yamamoto","year":"1983","unstructured":"Y. Yamamoto, \u201cA new variable dimension algorithm for the fixed point problem\u201d,Mathematical Programming 25 (1983) 329\u2013342.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591848.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591848\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:50Z","timestamp":1558395470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,7]]}},"alternative-id":["BF02591848"],"URL":"https:\/\/doi.org\/10.1007\/bf02591848","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,7]]}}}