{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:43:39Z","timestamp":1767141819216,"version":"build-2238731810"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T00:00:00Z","timestamp":1143072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s10589-005-3905-y","type":"journal-article","created":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T11:26:14Z","timestamp":1143113174000},"page":"183-214","source":"Crossref","is-referenced-by-count":8,"title":["A New Path-Following Algorithm for Nonlinear P*Complementarity Problems"],"prefix":"10.1007","volume":"34","author":[{"given":"Y. B.","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,3,23]]},"reference":[{"key":"3905_CR1","first-page":"265","volume":"26","author":"B.H. Ahn","year":"1983","unstructured":"B.H. Ahn, \u201cIterative methods for linear complementarity problem with uperbounds and lower-bounds,\u201d Math. Programming, vol. 26, pp. 265\u2013315, 1983.","journal-title":"Math. Programming"},{"key":"3905_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"E.D. Andersen","year":"1999","unstructured":"E.D. Andersen and Y. Ye, \u201cOn a homogeneous algorithm for the monotone complementarity problem,\u201d Math. Programming, vol. 84, pp. 375\u2013399, 1999.","journal-title":"Math. Programming"},{"key":"3905_CR3","first-page":"203","volume":"36","author":"M. Anitescu","year":"1997","unstructured":"M. Anitescu, G. Lesaja and F.A. Potra, \u201cAn infeasible-interior-point predictor-corrector algorithm for the P*-geometric LCP,\u201d Appl. Math. Optim., vol. 36, pp. 203\u2013228, 1997.","journal-title":"Appl. Math. Optim."},{"key":"3905_CR4","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1287\/moor.23.3.719","volume":"23","author":"J.V. Burke","year":"1998","unstructured":"J.V. Burke and S. Xu, \u201cThe global linear convergence of a non-interior path-following algorithm for linear complementarity problems,\u201d Math. Oper. Res., vol. 23, pp. 719\u2013734, 1998.","journal-title":"Math. Oper. Res."},{"key":"3905_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s101079900111","volume":"87","author":"J.V. Burke","year":"2000","unstructured":"J.V. Burke and S. Xu, \u201cA non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem,\u201d Math. Programming, vol. 87, pp. 113\u2013130, 2000.","journal-title":"Math. Programming"},{"key":"3905_CR6","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1137\/S1052623497321109","volume":"9","author":"B. Chen","year":"1999","unstructured":"B. Chen and X. Chen, \u201cA global and local superlinear continuation method for P0 and R 0 and monotone NCP,\u201d SIAM J. Optim., vol. 9, pp. 624\u2013645, 1999.","journal-title":"SIAM J. Optim."},{"key":"3905_CR7","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"R.W. Cottle, J.S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press: Boston, 1992."},{"key":"3905_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0024-3795(89)90463-1","volume":"114\/115","author":"R.W. Cottle","year":"1989","unstructured":"R.W. Cottle, J.S. Pang, and V. Venkateswaran, \u201cSufficient matrices and the linear complementarity problem,\u201d Linear Algebra Appl., vols. 114\/115, pp. 231\u2013249, 1989.","journal-title":"Linear Algebra Appl."},{"key":"3905_CR9","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/moor.23.3.735","volume":"23","author":"F. Facchinei","year":"1998","unstructured":"F. Facchinei, \u201cStructural and stability properties of P0 nonlinear complementarity problems,\u201d Math. Oper. Res., vol. 23, pp. 735\u2013745, 1998.","journal-title":"Math. Oper. Res."},{"key":"3905_CR10","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1137\/S0363012997322935","volume":"37","author":"F. Facchinei","year":"1999","unstructured":"F. Facchinei and C. Kanzow, \u201cBeyond monotonicity in regularization methods for nonlinear complementarity problems,\u201d SIAM J. Control Optim., vol. 37, pp. 1150\u20131161, 1999.","journal-title":"SIAM J. Control Optim."},{"key":"3905_CR11","volume-title":"Finite-dimensional variational inequalities and complementarity problems, vols. 1 and 2","author":"F. Facchinei","year":"2003","unstructured":"F. Facchinei and J.S. Pang, \u201cFinite-dimensional variational inequalities and complementarity problems,\u201d vols. 1 and 2, Springer-Verlag, New York, 2003."},{"key":"3905_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01588254","volume":"17","author":"Y. Fathi","year":"1979","unstructured":"Y. Fathi, \u201cComputational complexity of LCPs associated with positive definite matrices,\u201d Math. Programming, vol. 17, pp. 335\u2013344, 1979.","journal-title":"Math. Programming"},{"key":"3905_CR13","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0022-0531(72)90052-X","volume":"5","author":"T. Hansen","year":"1972","unstructured":"T. Hansen and T.C. Koopmans, \u201cOn the definition and computation of a capital stock invariant under optimization,\u201d J. Economic Theory, vol. 5, pp. 487\u2013523, 1972.","journal-title":"J. Economic Theory"},{"key":"3905_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1023648305969","volume":"117","author":"Z. Huang","year":"2003","unstructured":"Z. Huang, J. Han, and Z. Chen, \u201cPredictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a P0 function,\u201d J. Optim. Theory Appl., vol. 117, pp. 39\u201368, 2003.","journal-title":"J. Optim. Theory Appl."},{"key":"3905_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s001860400384","volume":"61","author":"Z. Huang","year":"2005","unstructured":"Z. Huang, \u201cLocating a maximally complementarity solution of the monotone NCP by using non-interior-point smoothing algorithm,\u201d Mathematical Methods of Operations Research vol. 61, pp. 41\u201355, 2005.","journal-title":"Mathematical Methods of Operations Research"},{"key":"3905_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/jmaa.1993.1101","volume":"174","author":"G. Isac","year":"1991","unstructured":"G. Isac, \u201cTikhonov\u2019s regularization and the complementarity problem in Hilbert space,\u201d J. Math. Anal. Appl., vol. 174, pp. 53\u201366, 1991.","journal-title":"J. Math. Anal. Appl."},{"key":"3905_CR17","first-page":"315","volume":"78","author":"B. Jansen","year":"1997","unstructured":"B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, \u201cPolynomiality of primal dual affine scaling algorithm for nonlinear complementarity problems,\u201d Math. Programming, vol. 78, pp. 315\u2013345, 1997.","journal-title":"Math. Programming"},{"key":"3905_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0024-3795(97)00282-6","volume":"272","author":"C. Jones","year":"1998","unstructured":"C. Jones and M.S. Gowda, \u201cOn the connectedness of solution sets in linear complementarity problems,\u201d Linear Algebra Appl., vol. 272, pp. 33\u201344, 1998.","journal-title":"Linear Algebra Appl."},{"key":"3905_CR19","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, and T. Noma, \u201cHomotopy continuation methods for nonlinear complementarity problems,\u201d Math. Oper. Res., vol. 16, pp. 754\u2013774, 1991.","journal-title":"Math. Oper. Res."},{"key":"3905_CR20","doi-asserted-by":"crossref","unstructured":"M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, \u201cA unified approach to interior point algorithms for linear complementarity problems,\u201d Lecture Notes in Computer Sciences, 538, Springer-Verlag: New York, 1991.","DOI":"10.1007\/3-540-54509-3"},{"key":"3905_CR21","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/moor.15.4.662","volume":"43","author":"M. Kojima","year":"1990","unstructured":"M. Kojima, M. Mizuno, and T. Noma, \u201cLimiting behavior of trajectories generated by a continuation method for monotone complementarity problems,\u201d Math. Oper. Res., vol. 43, pp. 662\u2013675, 1990.","journal-title":"Math. Oper. Res."},{"key":"3905_CR22","unstructured":"K.G. Murty, \u201cLinear Complementarity, Linear and Nonlinear Programming,\u201d Sigma Ser. Appl. Math. 3, Heldermann-Verlag: Berlin, 1988."},{"key":"3905_CR23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01580617","volume":"60","author":"J.S. Pang","year":"1993","unstructured":"J.S. Pang and S.A. Gabriel, \u201cNE\/SQP: A robust algorithm for the nonlinear complementarity problem,\u201d Math. Programming, vol. 60, pp. 295\u2013338, 1993.","journal-title":"Math. Programming"},{"key":"3905_CR24","first-page":"223","volume":"76","author":"F.A. Potra","year":"1997","unstructured":"F.A. Potra and R. Sheng, \u201cPredictor-corrector algorithm for solving P*\u03ba-matrix LCP from arbitrary positive starting points,\u201d Math. Programming, vol. 76, pp. 223\u2013244, 1997.","journal-title":"Math. Programming"},{"key":"3905_CR25","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/S1052623495279359","volume":"7","author":"F.A. Potra","year":"1997","unstructured":"F.A. Potra and R. Sheng, \u201cA large-step infeasible-interior-point method for the P*-matrix LCP,\u201d SIAM J. Optim., vol. 7, pp. 318\u2013335, 1997.","journal-title":"SIAM J. Optim."},{"key":"3905_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L. Qi","year":"1993","unstructured":"L. Qi, \u201cConvergence analysis of some algorithms for solving nonsmooth equations,\u201d Math. Oper. Res., vol. 18, pp. 227\u2013243, 1993.","journal-title":"Math. Oper. Res."},{"key":"3905_CR27","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/S1052623497329567","volume":"11","author":"G. Ravindran","year":"2000","unstructured":"G. Ravindran and M.S. Gowda, \u201cRegularization of P0-functions in box variational inequality problems,\u201d SIAM J. Optim., vol. 11, pp. 748\u2013760, 2000.","journal-title":"SIAM J. Optim."},{"key":"3905_CR28","first-page":"407","volume":"83","author":"J. Stoer","year":"1998","unstructured":"J. Stoer and M. Wechs, \u201cInfeasible-interior-point paths for sufficient linear complementarity problems and their analyticity,\u201d Math. Programming, vol. 83, pp. 407\u2013423, 1998.","journal-title":"Math. Programming"},{"key":"3905_CR29","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/moor.23.4.832","volume":"23","author":"J. Stoer","year":"1998","unstructured":"J. Stoer, M. Wechs, and S. Mizuno, \u201cHigh order infeasible-interior-point methods for solving sufficient linear complementarity problems,\u201d Math. Oper. Res., vol. 23, pp. 832\u2013862, 1998.","journal-title":"Math. Oper. Res."},{"key":"3905_CR30","doi-asserted-by":"crossref","unstructured":"R. Sznajder and M.S. Gowda, \u201cOn the limiting behavior of the trajectory of regularized solutions of P0 complementarity problems,\u201d in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima, and L. Qi (Eds.), Kluwer Academic Publishers, 1998, pp. 371\u2013379.","DOI":"10.1007\/978-1-4757-6388-1_19"},{"key":"3905_CR31","doi-asserted-by":"crossref","unstructured":"P. Tseng, \u201cError Bounds for Regularized Complementarity Problems,\u201d Report, Department of Mathematics, University of Washington, Seattle, 1998.","DOI":"10.1007\/978-3-642-45780-7_15"},{"key":"3905_CR32","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1137\/S105262349427409X","volume":"7","author":"P. Tseng","year":"1997","unstructured":"P. Tseng, \u201cAn infeasible path-following method for monotone complementarity problems,\u201d SIAM J. Optim., vol. 7, pp. 386\u2013402, 1997.","journal-title":"SIAM J. Optim."},{"key":"3905_CR33","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,\u201d SIAM J. Control Optim., vol. 17, pp. 36\u201346, 1979.","journal-title":"SIAM J. Control Optim."},{"key":"3905_CR34","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1287\/moor.21.4.815","volume":"21","author":"S. Wright","year":"1996","unstructured":"S. Wright and D. Ralph, \u201cSuperlinear infeasible-interior-point algorithm for monotone complementarity problems,\u201d Math. Oper. Res., vol. 21, pp. 815\u2013838, 1996.","journal-title":"Math. Oper. Res."},{"key":"3905_CR35","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s101070050081","volume":"86","author":"S. Xu","year":"1999","unstructured":"S. Xu and J.V. Burke, \u201cA polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques,\u201d Math. Programming, vol. 86, pp. 91\u2013103, 1999.","journal-title":"Math. Programming"},{"key":"3905_CR36","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02614384","volume":"76","author":"Y. Ye","year":"1997","unstructured":"Y. Ye, \u201cOn homogeneous and self-dual algorithms for LCP,\u201d Math. Programming, vol. 76, pp. 211\u2013222, 1997.","journal-title":"Math. Programming"},{"key":"3905_CR37","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Y. Ye, Interior Point Algorithms Theory and Analysis, John Wiley and Sons: Chichester, UK, 1997."},{"key":"3905_CR38","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/S0363012998345196","volume":"39","author":"Y.B. Zhao","year":"2000","unstructured":"Y.B. Zhao and G. Isac, \u201cProperties of a multi-valued mapping associated with some nonmonotone complementarity problems,\u201d SIAM J. Control Optim., vol. 39, pp. 571\u2013593, 2000.","journal-title":"SIAM J. Control Optim."},{"key":"3905_CR39","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1023\/A:1026459501988","volume":"107","author":"Y.B. Zhao","year":"2000","unstructured":"Y.B. Zhao and D. Li, \u201cStrict feasibility conditions of complementarity problems,\u201d J. Optim. Theory Appl., vol. 107, pp. 641\u2013664, 2000.","journal-title":"J. Optim. Theory Appl."},{"key":"3905_CR40","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.26.1.119.10594","volume":"26","author":"Y.B. Zhao","year":"2001","unstructured":"Y.B. Zhao and D. Li, \u201cOn a new homotopy continuation trajectory for complementarity problems,\u201d Math. Oper. Res., vol. 26, pp. 119\u2013146, 2001.","journal-title":"Math. Oper. Res."},{"key":"3905_CR41","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1137\/S0363012900372477","volume":"40","author":"Y.B. Zhao","year":"2001","unstructured":"Y.B. Zhao and D. Li, \u201cExistence and limiting behavior of a non-interior-point trajectory for complementarity problems without strictly feasible condition,\u201d SIAM J. Control Optim., vol. 40, pp. 898\u2013924, 2001.","journal-title":"SIAM J. Control Optim."}],"updated-by":[{"DOI":"10.1007\/s10589-006-9594-3","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2006,8,14]],"date-time":"2006-08-14T00:00:00Z","timestamp":1155513600000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3905-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3905-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3905-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:29Z","timestamp":1559288189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3905-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,23]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["3905"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3905-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,23]]}}}