{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T07:40:47Z","timestamp":1712389247661},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T00:00:00Z","timestamp":1303257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10957-011-9848-9","type":"journal-article","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T20:54:50Z","timestamp":1303246490000},"page":"444-474","source":"Crossref","is-referenced-by-count":18,"title":["Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones"],"prefix":"10.1007","volume":"150","author":[{"given":"G.","family":"Lesaja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,20]]},"reference":[{"issue":"6","key":"9848_CR1","doi-asserted-by":"crossref","first-page":"3014","DOI":"10.1137\/090766735","volume":"20","author":"G. Lesaja","year":"2010","unstructured":"Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for P \u2217(\u03ba)-LCP. SIAM J. Optim. 20(6), 3014\u20133039 (2010)","journal-title":"SIAM J. Optim."},{"key":"9848_CR2","series-title":"Oxford Mathematical Monographs","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\u00e0ny, A.: Analysis on Symmetric Cones. Oxford Mathematical Monographs. Clarendon\/Oxford University Press, New York (1994)"},{"key":"9848_CR3","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics, vol.\u00a013. SIAM, Philadelphia (1994)"},{"issue":"1","key":"9848_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y. Nesterov","year":"1997","unstructured":"Nesterov, Y., Todd, M.J.: Self-scaled barriers and interior-points methods for convex programming. Math. Oper. Res. 22(1), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9848_CR5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y. Nesterov","year":"1998","unstructured":"Nesterov, Y., 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."},{"issue":"4","key":"9848_CR6","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."},{"issue":"1","key":"9848_CR7","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(1), 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"9848_CR8","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"},{"issue":"3","key":"9848_CR9","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.26.3.543.10582","volume":"26","author":"S.H. 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(3), 543\u2013564 (2001)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9848_CR10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S.H. Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior-point algorithms to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"9848_CR11","unstructured":"Vieira, M.: Jordan algebraic approach to symmetric optimization. Ph.D. Thesis, TU Delft (2007)"},{"key":"9848_CR12","unstructured":"Gu, G.: Interior-point methods for symmetric optimization. Ph.D. Thesis, TU Delft (2009)"},{"key":"9848_CR13","first-page":"203","volume":"36","author":"M. Anitescu","year":"1997","unstructured":"Anitescu, M., Lesaja, G., Potra, F.A.: An infeasible interior-point predictor-corrector algorithm for the P \u2217-geometric LCP. Appl. Math. Optim. 36, 203\u2013228 (1997)","journal-title":"Appl. Math. Optim."},{"key":"9848_CR14","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. Methods Softw. 7, 265\u2013290 (1997)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9848_CR15","first-page":"19","volume":"4","author":"Y.Q. Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C.: A new class of polynomial interior-point algorithms for linear complementarity problems. Pac. J. Optim. 4(1), 19\u201341 (2008)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"9848_CR16","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/050623723","volume":"17","author":"X. Liu","year":"2006","unstructured":"Liu, X., Potra, F.A.: Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path. SIAM J. Optim. 17(3), 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"key":"9848_CR17","series-title":"Lecture Notes in Computer Science","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., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity problems. Lecture Notes in Computer Science, vol. 538. Springer, New York (1991)"},{"key":"9848_CR18","first-page":"355","volume":"69","author":"J. Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent $O((1+\\kappa)\\sqrt{n}L)$ -iteration algorithm for the P \u2217(\u03ba)-matrix linear complementarity problem. Math. Program. 69, 355\u2013368 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"9848_CR19","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10107-003-0472-9","volume":"100","author":"F.A. Potra","year":"2004","unstructured":"Potra, F.A.: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\\sqrt{n}L)$ -iteration complexity. Math. Program., Ser. A 100(2), 317\u2013337 (2004)","journal-title":"Math. Program., Ser. A"},{"key":"9848_CR20","first-page":"269","volume":"73","author":"S.J. Wright","year":"1996","unstructured":"Wright, S.J., Zhang, Y.: A superquadratic infeasible-interior-point method for linear complementarity problems. Math. Program. 73, 269\u2013289 (1996)","journal-title":"Math. Program."},{"key":"9848_CR21","doi-asserted-by":"crossref","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, 211\u2013221 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"9848_CR22","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 problems in symmetric matrices. SIAM J. Optim. 7(1), 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"key":"9848_CR23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107980021a","volume":"84","author":"R.D.C. Monteiro","year":"1999","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: Polynomiality of primal-dual algorithms for semidefinite linear complementarity problem based on the Kojima-Shindoh-Hara family of directions. Math. Program. 84, 39\u201353 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"9848_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1080\/10556789808805695","volume":"9","author":"P. Tseng","year":"1998","unstructured":"Tseng, P.: Search directions and convergence analysis of some infeasible path-following methods for monotone semidefinite LCP. Optim. Methods Softw. 9(4), 245\u2013268 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"9848_CR25","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/040606557","volume":"16","author":"B.K. 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."},{"key":"9848_CR26","doi-asserted-by":"crossref","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, 1129\u20131153 (2006)","journal-title":"SIAM J. Optim."},{"key":"9848_CR27","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."},{"issue":"1","key":"9848_CR28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"Y.Q. Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"key":"9848_CR29","doi-asserted-by":"crossref","unstructured":"Baes, M.: Spectral functions and smoothing techniques on Jordan algebras. Ph.D. Thesis, Catholic University of Louvain (2006)","DOI":"10.2139\/ssrn.914150"},{"key":"9848_CR30","unstructured":"Chung, S.J.: A note on the complexity of LCP. The LCP is strongly NP-complete. Technical Report No. 792, Department of Industrial and Operations Engineering, The University of Michigan (1979)"},{"issue":"3","key":"9848_CR31","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F. Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberley, J.-P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9848_CR32","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowiwicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9848_CR33","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580085","volume":"81","author":"R.D.C. Monteiro","year":"1998","unstructured":"Monteiro, R.D.C., Zhang, Y.: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81(3), 281\u2013299 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9848_CR34","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1023\/A:1017920200889","volume":"112","author":"M. Muramatsu","year":"2002","unstructured":"Muramatsu, M.: On a commutative class of search directions for linear programming over symmetric cones. J. Optim. Theory Appl. 112(3), 595\u2013625 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9848_CR35","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s000130050471","volume":"75","author":"Y. Lim","year":"2000","unstructured":"Lim, Y.: Geometric means on symmetric cones. Arch. Math. (Basel) 75(1), 39\u201345 (2000)","journal-title":"Arch. Math. (Basel)"},{"key":"9848_CR36","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J. Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)"},{"issue":"6","key":"9848_CR37","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/10556780310001639735","volume":"18","author":"Y.Q. Bai","year":"2003","unstructured":"Bai, Y.Q., Roos, C.: A polynomial-time algorithm for linear optimization based on a new simple kernel function. Optim. Methods Softw. 18(6), 631\u2013646 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9848_CR38","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10957-008-9389-z","volume":"138","author":"Y.Q. Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C., Wang, G.Q., El Ghami, M.: A class of large- and small-update primal-dual interior-point algorithms for linear optimization. J. Optim. Theory Appl. 138(3), 341\u2013359 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"9848_CR39","series-title":"An Interior-Point Approach. Springer Science","volume-title":"Theory and Algorithms for Linear Optimization","author":"C. Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, J.Ph.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. Springer Science. Springer, New York (2005)"},{"key":"9848_CR40","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/10556780008805800","volume":"14","author":"Z.Q. Luo","year":"2000","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, Y.: Conic convex programming and self-dual embedding. Optim. Methods Softw. 14, 169\u2013218 (2000)","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9848-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-011-9848-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9848-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T07:21:34Z","timestamp":1712388094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-011-9848-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,20]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["9848"],"URL":"https:\/\/doi.org\/10.1007\/s10957-011-9848-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,20]]}}}