{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:50Z","timestamp":1740122750336,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T00:00:00Z","timestamp":1537574400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T00:00:00Z","timestamp":1537574400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["DE-AC52-07NA27344"],"award-info":[{"award-number":["DE-AC52-07NA27344"]}],"id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1311923"],"award-info":[{"award-number":["DMS-1311923"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10589-018-0035-x","type":"journal-article","created":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T14:42:53Z","timestamp":1537627373000},"page":"241-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A homogeneous model for monotone mixed horizontal linear complementarity problems"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1050-3221","authenticated-orcid":false,"given":"Cosmin G.","family":"Petra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian A.","family":"Potra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,22]]},"reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1018369223322","volume":"10","author":"E Andersen","year":"1998","unstructured":"Andersen, E., Ye, Y.: A computational study of the homogeneous algorithm for large-scale convex optimization. Comput. Optim. Appl. 10(3), 243\u2013280 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"E Andersen","year":"1999","unstructured":"Andersen, E., Ye, Y.: On a homogeneous algorithm for the monotone complementarity problem. Math. Program. 84(2), 375\u2013399 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","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. Methods Softw. 7(3), 265\u2013290 (1997)","journal-title":"Optim. Methods Softw."},{"issue":"7","key":"35_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0167-6377(92)90026-Y","volume":"11","author":"K Anstreicher","year":"1992","unstructured":"Anstreicher, K.: On interior algorithms for linear programming with no regularity assumptions. Oper. Res. Lett. 11(7), 209\u2013212 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.21.1.1","volume":"21","author":"JF Bonnans","year":"1996","unstructured":"Bonnans, J.F., Gonzaga, C.C.: Convergence of interior point algorithms for the monotone linear complementarity problem. Math. Oper. Res. 21(1), 1\u201325 (1996)","journal-title":"Math. Oper. Res."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Czyzyk, J., Mehrotra, S., Wright, S.J.: PCx user guide. Technical Report OTC 96\/01. Optimization Technology Center, Argonne National Laboratory and Northwestern University (1996)","DOI":"10.2172\/475586"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/641876.641880","volume":"29","author":"EM Gertz","year":"2003","unstructured":"Gertz, E.M., Wright, S.J.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29(1), 58\u201381 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0377-2217(95)00163-K","volume":"85","author":"J Gondzio","year":"1995","unstructured":"Gondzio, J.: HOPDM (version 2.12)\u2014a fast LP solver based on a primal-dual interior point method. Eur. J. Oper. Res. 85, 221\u2013225 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0893-9659(94)00118-V","volume":"8","author":"MS Gowda","year":"1995","unstructured":"Gowda, M.S.: Reducing a monotone horizontal LCP to an LCP. Appl. Math. Lett. 8(1), 97\u2013100 (1995)","journal-title":"Appl. Math. Lett."},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.20.2.441","volume":"20","author":"O G\u00fcler","year":"1995","unstructured":"G\u00fcler, O.: Generalized linear complementarity problems. Math. Oper. Res. 20(2), 441\u2013448 (1995)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/ijoc.2016.0715","volume":"29","author":"KL Huang","year":"2017","unstructured":"Huang, K.L., Mehrotra, S.: Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method. INFORMS J. Comput. 29(1), 36\u201353 (2017)","journal-title":"INFORMS J. Comput."},{"key":"35_CR12","doi-asserted-by":"publisher","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, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"35_CR13","first-page":"541","volume":"35","author":"Y Lin","year":"2007","unstructured":"Lin, Y., Yoshise, A.: A homogeneous model for mixed complementarity problems over symmetric cones. Vietnam J. Math. 35, 541\u2013562 (2007)","journal-title":"Vietnam J. Math."},{"issue":"3","key":"35_CR14","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I Lustig","year":"1992","unstructured":"Lustig, I., Marsten, R.E., Shanno, D.F.: On implementing Mehrotra\u2019s predictor\u2013corrector interior-point method for linear programming. SIAM J. Optim. 2(3), 435\u2013449 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"35_CR15","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"35_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1287\/moor.21.3.629","volume":"21","author":"RDC Monteiro","year":"1996","unstructured":"Monteiro, R.D.C., Pang, J.S.: Properties of an interior-point mapping for mixed complementarity problems. Math. Oper. Res. 21(3), 629\u2013654 (1996)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"35_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1287\/moor.23.1.39","volume":"23","author":"RDC Monteiro","year":"1998","unstructured":"Monteiro, R.D.C., Pang, J.S.: On two interior-point mappings for nonlinear semidefinite complementarity problems. Math. Oper. Res. 23(1), 39\u201360 (1998)","journal-title":"Math. Oper. Res."},{"key":"35_CR18","unstructured":"Petra, C.G.: Homogenization of mixed horizontal LCPs and applications. Ph.D. thesis, University of Maryland, Baltimore County (2009)"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/0024-3795(93)00184-2","volume":"223\u2013224","author":"R Sznajder","year":"1995","unstructured":"Sznajder, R., Gowda, M.S.: Generalizations of P0- and P-properties; extended vertical and horizontal linear complementarity problems. Linear Algebra Appl. 223\u2013224, 695\u2013715 (1995)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"35_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02614384","volume":"76","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: On homogeneous and self-dual algorithms for LCP. Math. Program. 76(1), 211\u2013221 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"35_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $${O}(\\sqrt{n}{L})$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"35_CR22","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1137\/04061427X","volume":"17","author":"A Yoshise","year":"2006","unstructured":"Yoshise, A.: Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones. SIAM J. Optim. 17(4), 1129\u20131153 (2006)","journal-title":"SIAM J. Optim."},{"key":"35_CR23","first-page":"83","volume":"49","author":"A Yoshise","year":"2007","unstructured":"Yoshise, A.: A homogeneous algorithm for monotone complementarity problems over symmetric cones. Front. Sci. Ser. 49, 83 (2007)","journal-title":"Front. Sci. Ser."},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02206814","volume":"62","author":"D Zhang","year":"1996","unstructured":"Zhang, D., Zhang, Y.: A Mehrotra-type predictor-corrector algorithm with polynomiality and $$Q$$-subquadratic convergence. Ann. Oper. Res. 62, 131\u2013150 (1996)","journal-title":"Ann. Oper. Res."},{"key":"35_CR25","unstructured":"Zhang, Y.: Solving large-scale linear programs by interior-point methods under the MATLAB environment. Technical Report TR96-01. University of Maryland Baltimore County (1996)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0035-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0035-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0035-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:00:02Z","timestamp":1589713202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0035-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,22]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0035-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,9,22]]},"assertion":[{"value":"31 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}