{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:13:13Z","timestamp":1718550793640},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,19]],"date-time":"2016-05-19T00:00:00Z","timestamp":1463616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11075-016-0140-9","type":"journal-article","created":{"date-parts":[[2016,5,19]],"date-time":"2016-05-19T15:29:12Z","timestamp":1463671752000},"page":"93-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An infeasible full-NT step interior point algorithm for CQSCO"],"prefix":"10.1007","volume":"74","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,19]]},"reference":[{"issue":"4","key":"140_CR1","doi-asserted-by":"crossref","first-page":"891","DOI":"10.3934\/jimo.2011.7.891","volume":"7","author":"YQ Bai","year":"2011","unstructured":"Bai, Y.Q., Zhang, L.P.: A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization. J. Ind. Manag. Optim. 7(4), 891\u2013906 (2011)","journal-title":"J. Ind. Manag. Optim."},{"key":"140_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones, Oxford Mathematical Monographs","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kornyi, A.: Analysis on Symmetric Cones, Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York (1994)"},{"issue":"1","key":"140_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":"140_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":"3","key":"140_CR5","first-page":"541","volume":"40","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B., Mahdavi-Amiri, N.: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem. Bull. Iranian Math. Soc. 40(3), 541\u2013564 (2014)","journal-title":"Bull. Iranian Math. Soc."},{"issue":"3","key":"140_CR6","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s10957-013-0457-7","volume":"161","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems. J. Optim. Theory Appl. 161(3), 853\u2013869 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"140_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10479-013-1474-5","volume":"211","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A new infeasible interior-point method based on Darvay\u2019s technique for symmetric optimization. Ann. Oper. Res. 211(1), 209\u2013224 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"140_CR8","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/naco.2013.3.601","volume":"3","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function, Numer. Algebra Control Optim. 3(4), 601\u2013614 (2013)","journal-title":"Algebra Control Optim."},{"key":"140_CR9","doi-asserted-by":"crossref","unstructured":"Kheirfam, B.: A full step infeasible interior-point method for Cartesian P \u2217(\u03ba)-SCLCP. Optim. Lett. 10(3), 591\u2013603 (2016)","DOI":"10.1007\/s11590-015-0884-5"},{"key":"140_CR10","doi-asserted-by":"crossref","unstructured":"Kheirfam, B.: An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem. Numer. Algorithms. 71(3), 491\u2013503 (2016)","DOI":"10.1007\/s11075-015-0005-7"},{"issue":"1","key":"140_CR11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/s10957-014-0554-2","volume":"164","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B.: A corrector-predictor path-following method for convex quadratic symmetric cone optimization. J. Optim. Theory Appl. 164(1), 246\u2013260 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"140_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61, 263\u2013280 (1993)","journal-title":"Math. Program."},{"key":"140_CR13","first-page":"199","volume":"2","author":"L Li","year":"2010","unstructured":"Li, L., Toh, K.C.: A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming. J. Math. Indus. 2, 199\u2013212 (2010B)","journal-title":"J. Math. Indus."},{"key":"140_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasibility issues in a primal-dual interior-point methods for linear programming. Math. Progrem. 49, 145\u2013162 (1990)","journal-title":"Math. Progrem."},{"key":"140_CR15","unstructured":"Maros, I., Meszaros, C.: Departmental Technical Report DOC 97\/6, Department of Computing, Imperial College, London, U.K., A repository of convex quadratic programming problems"},{"key":"140_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"140_CR17","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."},{"key":"140_CR18","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, 1110\u20131138 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"140_CR19","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1137\/140975462","volume":"25","author":"C Roos","year":"2015","unstructured":"Roos, C.: An improved and simplified full-Newton step O(n) infeasible interior-point method for linear optimization. SIAM J. Optim. 25(1), 102\u2013114 (2015)","journal-title":"SIAM J. Optim."},{"key":"140_CR20","volume-title":"Theory and Algorithms for Linear Optimization. An Interior-Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J-Ph: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. Wiley, Chichester (1997)"},{"issue":"3","key":"140_CR21","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."},{"issue":"1-3","key":"140_CR22","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. Linear Algebra Appl. 312(1-3), 135\u2013154 (2000)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"140_CR23","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1080\/01630563.2012.740545","volume":"34","author":"GQ Wang","year":"2013","unstructured":"Wang, G.Q., Zhang, Z.H., Zhu, D.T.: On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization. Numer. Funct. Anal. Optim. 34(5), 576\u2013603 (2013)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"140_CR24","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.amc.2013.06.064","volume":"221","author":"GQ Wang","year":"2013","unstructured":"Wang, G.Q., Yu, C.J., Teo, K.L.: A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization. Appl. Math. Comput. 221, 329\u2013343 (2013)","journal-title":"Appl. Math. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-016-0140-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-016-0140-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-016-0140-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-016-0140-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T14:50:21Z","timestamp":1718549421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-016-0140-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,19]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s11075-016-0140-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,19]]}}}