{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:23:48Z","timestamp":1773347028273,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T00:00:00Z","timestamp":1344470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s11075-012-9628-0","type":"journal-article","created":{"date-parts":[[2012,8,8]],"date-time":"2012-08-08T03:47:08Z","timestamp":1344397628000},"page":"385-398","source":"Crossref","is-referenced-by-count":32,"title":["Polynomial interior-point algorithm for P * ${(\\kappa)}$ horizontal linear complementarity problems"],"prefix":"10.1007","volume":"63","author":[{"given":"S.","family":"Asadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Mansouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,9]]},"reference":[{"key":"9628_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A unified approach to interior point algorithms for linear complementarity problems","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshishe, A.: A unified approach to interior point algorithms for linear complementarity problems. Springer, Berlin (1991)"},{"key":"9628_CR2","first-page":"103","volume":"239","author":"H V\u00e4liaho","year":"1996","unstructured":"V\u00e4liaho, H.: P *-matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"9628_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"2","key":"9628_CR4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0805013","volume":"5","author":"KM Anstreicher","year":"1995","unstructured":"Anstreicher, K.M., Bosch, R.A.: A new infinity-norm path following algorithm for linear programming. SIAM J. Optim. 5(2), 236\u2013246 (1995)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9628_CR5","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4), 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"9628_CR6","volume-title":"Theory and algorithms for linear optimization","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.P.: Theory and algorithms for linear optimization. An interior-point approach. John Wiley and Sons, Chichester, UK (1997) (2nd Edition, Springer (2006))"},{"key":"9628_CR7","first-page":"309","volume":"76","author":"C Gonzaga","year":"1997","unstructured":"Gonzaga, C.: The largest step path following algorithm for monotone linear complementarity problems. Math. Program. 76, 309\u2013332 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"9628_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10556789708805657","volume":"7","author":"M Anitescu","year":"1997","unstructured":"Anitescu, M., Lesaja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Method Softw. 7(3), 265\u2013290 (1997)","journal-title":"Optim. Method Softw."},{"issue":"2","key":"9628_CR9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"WB Ai","year":"2005","unstructured":"Ai, W.B., Zhang, S.Z.: An $O(\\sqrt{n}L)$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone linear complementarity problems. SIAM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"key":"9628_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s101070200296","volume":"93","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93, 129\u2013171 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"9628_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s11075-009-9270-7","volume":"52","author":"H Mansouri","year":"2009","unstructured":"Mansouri, H., Roos, C.: A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52(2), 225\u2013255 (2009)","journal-title":"Numer. Algorithms"},{"key":"9628_CR12","volume-title":"Interior point polynomial methods in convex programming: Theory and algorithms. SIAM Publications","author":"YE Nesterov","year":"1993","unstructured":"Nesterov, Y.E., Nemirovski, A.S.: Interior point polynomial methods in convex programming: Theory and algorithms. SIAM Publications. SIAM, Philadelphia, USA (1993)"},{"key":"9628_CR13","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.nonrwa.2010.06.039","volume":"12","author":"H Mansouri","year":"2011","unstructured":"Mansouri, H., Zangiabadi, M., Pirhaji, M.: A full-Newton step O(n) infeasible interior-point algorithm for linear complementarity problems. Nonlinear Anal. Real World Appl. 12, 545\u2013561 (2011)","journal-title":"Nonlinear Anal. Real World Appl."},{"key":"9628_CR14","doi-asserted-by":"crossref","unstructured":"Zangiabadi, M., Mansouri, H.: Improved infeasible-interior-point algorithm for linear complementarity problems. Bull. Iran. Math. Soc. (2011, in press)","DOI":"10.1016\/j.nonrwa.2010.06.039"},{"issue":"3","key":"9628_CR15","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1080\/10556780600816692","volume":"22","author":"H Mansouri","year":"2007","unstructured":"Mansouri, H., Roos, C.: Simplified O(n) infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519\u2013530 (2007)","journal-title":"Optim. Methods Softw."},{"key":"9628_CR16","unstructured":"Mansouri, H.: Full-Newton step interior-point methods for conic optimization. PhD. thesis, Faculty of Mathematics and Computer Science, TU Delft, NL\u20132628\u00a0CD\u00a0Delft, The Netherlands (2008)"},{"issue":"4","key":"9628_CR17","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"9628_CR18","first-page":"407","volume":"83","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. 83, 407\u2013423 (1998)","journal-title":"Math. Program."},{"key":"9628_CR19","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10589-009-9263-4","volume":"48","author":"F Gurtuna","year":"2011","unstructured":"Gurtuna, F., Petra, C., Potra, F.A., Shevehenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48, 453\u2013485 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"9628_CR20","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cam.2009.07.014","volume":"233","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithms for P *(\u03ba) horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248\u2013263 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"9628_CR21","first-page":"432","volume":"20","author":"ZH Huang","year":"2000","unstructured":"Huang, Z.H.: Polynomiality of high-order feasible interior point method for solving the horizontal linear complementarity problems. J. System Sci. Math. Sci. 20(4), 432\u2013438 (2000)","journal-title":"J. System Sci. Math. Sci."},{"key":"9628_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0377-0427(00)00550-1","volume":"129","author":"NH Xiu","year":"2001","unstructured":"Xiu, N.H., Zhang, J.Z.: A smoothing Gauss-Newton method for the generalized HLCP.\u00a0J. Comput. Appl. Math. 129, 195\u2013208 (2001)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"9628_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2007.03.031","volume":"216","author":"CF Ma","year":"2008","unstructured":"Ma, C.F., Chen, X.H.: The convergence of a one-step smoothing Newton method for P 0-NCP based on a new smoothing NCP-function. J. Comput. Appl. Math. 216(1), 1\u201313 (2008)","journal-title":"J. Comput. Appl. Math."},{"issue":"3, Ser. A","key":"9628_CR24","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01582228","volume":"67","author":"FA Potra","year":"1994","unstructured":"Potra, F.A.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67(3, Ser. A), 383\u2013406 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"9628_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0806002","volume":"6","author":"FA Potra","year":"1996","unstructured":"Potra, F.A.: An infeasible-interior-point predictor-corrector algorithm for linear programming. SIAM J. Optim. 6(1), 19\u201332 (1996)","journal-title":"SIAM J. Optim."},{"key":"9628_CR26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02206812","volume":"62","author":"FA Potra","year":"1996","unstructured":"Potra, F.A.: An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. Ann. Oper. Res. 62, 81\u2013102 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9628_CR27","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"issue":"1","key":"9628_CR28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25(1), 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"key":"9628_CR29","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A new full Nesterov-Todd step primal-dual path-follwing interior-point algorithm for symmetric optimization. J. Optim. Theory Appl. (2012). doi: 10.1007\/s10957-012-0013-x","journal-title":"J. Optim. Theory Appl."},{"issue":"3, Ser. A","key":"9628_CR30","first-page":"407","volume":"83","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. 83(3, Ser. A), 407\u2013423 (1998)","journal-title":"Math. Program."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9628-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9628-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9628-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T16:20:22Z","timestamp":1562084422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9628-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,9]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9628"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9628-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,9]]}}}