{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:00:58Z","timestamp":1763017258957},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T00:00:00Z","timestamp":1361232000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s11590-013-0618-5","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T08:41:56Z","timestamp":1361263316000},"page":"1017-1029","source":"Crossref","is-referenced-by-count":14,"title":["A new interior-point algorithm based on modified Nesterov\u2013Todd direction for symmetric cone linear complementarity problem"],"prefix":"10.1007","volume":"8","author":[{"given":"B.","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,19]]},"reference":[{"key":"618_CR1","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)"},{"key":"618_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford University Press, New York (1994)"},{"issue":"1","key":"618_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s002090100286","volume":"239","author":"L Faybusovich","year":"2002","unstructured":"Faybusovich, L.: A Jordan-algebraic approach to potential-reduction algorithms. Mathematicsche Zeitschrift 239(1), 117\u2013129 (2002)","journal-title":"Mathematicsche Zeitschrift"},{"key":"618_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86, 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"618_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1009701824047","volume":"1","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1(4), 331\u2013357 (1997)","journal-title":"Positivity"},{"key":"618_CR6","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.ejor.2011.02.022","volume":"214","author":"G Gu","year":"2011","unstructured":"Gu, G., Zangiabadi, M., Roos, C.: Full Nesterov\u2013Todd step infeasible interior-point method for symmetric optimization. Eur. J. Oper. Res. 214, 473\u2013484 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"618_CR7","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O G\u00fcler","year":"1996","unstructured":"G\u00fcler, O.: Barrier functions in interior-point methods. Math. Oper. Res. 21(4), 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"key":"618_CR8","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, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"618_CR9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7, 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"618_CR10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/s10957-011-9848-9","volume":"150","author":"G Lesaja","year":"2011","unstructured":"Lesaja, G., Roos, C.: Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones. J. Optim. Theory Appl. 150(3), 444\u2013474 (2011)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"618_CR11","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"618_CR12","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M.: The linear complementarity problem. In: Advances in Optimization and Numerical Analysis. Kluwer Academic Publishers, Dordrecht, pp. 39\u201349 (1994)","DOI":"10.1007\/978-94-015-8330-5_3"},{"issue":"4","key":"618_CR13","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1137\/0614069","volume":"14","author":"PM Pardalos","year":"1993","unstructured":"Pardalos, P.M., Ye, Y., Han, C.-G., Kalinski, J.: Solution of $$P$$ -matrix linear complementarity problems using a potential reduction algorithm. SIAM J. Matrix Anal. Appl. 14(4), 1048\u20131060 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"618_CR14","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/040606557","volume":"16","author":"BK Rangarajan","year":"2006","unstructured":"Rangarajan, B.K.: Polynomial convergence of infeasible interior-point methods over symmetric cones. SIAM J. Optim. 16(4), 1211\u20131229 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"618_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior-point algorithm to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"618_CR16","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.26.3.543.10582","volume":"26","author":"SH Schmieta","year":"2001","unstructured":"Schmieta, S.H., Alizadeh, F.: Associative and Jordan algebras and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 26, 543\u2013564 (2001)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"618_CR17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Algebra Appl. 312(1\u20133), 135\u2013154 (2000)","journal-title":"Algebra Appl."},{"key":"618_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10556789908805750","volume":"11\u201312","author":"T Tsuchiya","year":"1999","unstructured":"Tsuchiya, T.: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Optim. Methods Softw. 11\u201312, 141\u2013182 (1999)","journal-title":"Optim. Methods Softw."},{"key":"618_CR19","unstructured":"Vieira, M.V.C.: Jordan algebraic approach to symmetric optimization. Ph.D. thesis, Delft University of Technology, Delft (2007)"},{"key":"618_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"Y Ye","year":"1991","unstructured":"Ye, Y., Pardalos, P.M.: A class of linear complementarity problems solvable in polynomial time. Linear Algebra Appl 152, 3\u201317 (1991)","journal-title":"Linear Algebra Appl"},{"key":"618_CR21","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.18.2.334","volume":"18","author":"Y Ye","year":"1993","unstructured":"Ye, Y.: A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem. Math. Oper. Res. 18, 334\u2013345 (1993)","journal-title":"Math. Oper. Res."},{"key":"618_CR22","first-page":"313","volume":"5","author":"A Yoshise","year":"2009","unstructured":"Yoshise, A.: Homogeneous algorithms for monotone complementarity problems over symmetric cones. Pac. J. Optim. 5, 313\u2013337 (2009)","journal-title":"Pac. J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0618-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0618-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0618-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T05:49:14Z","timestamp":1714974554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0618-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,19]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["618"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0618-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,19]]}}}