{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:14:27Z","timestamp":1761808467784,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10915-021-01609-6","type":"journal-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T10:02:46Z","timestamp":1628848966000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7928-2618","authenticated-orcid":false,"given":"B.","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,13]]},"reference":[{"issue":"2","key":"1609_CR1","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"Ai, W., Zhang, S.: An $$O(\\sqrt{n}L)$$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SAIM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SAIM J. Optim."},{"key":"1609_CR2","unstructured":"Alizadeh, F.: Combinatorial Optimization with Interior-Point Methods and Semidefinite Matrices, Ph.D. thesis, Computer Science Department, University of Minnesota, Minneapolis, MN; (1991)"},{"key":"1609_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior-Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM J. Optim. 5, 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"1609_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S Boyd","year":"1994","unstructured":"Boyd, S., Ghoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)"},{"key":"1609_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E de Klerk","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"1609_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"1609_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, New York (1991)"},{"key":"1609_CR8","first-page":"117","volume":"76","author":"B Jansen","year":"1996","unstructured":"Jansen, B., Roos, C., Terlaky, T., Ye, Y.: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Math. Program. 76, 117\u2013130 (1996)","journal-title":"Math. Program."},{"issue":"4","key":"1609_CR9","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s11075-012-9557-y","volume":"61","author":"B Kheirfam","year":"2012","unstructured":"Kheirfam, B.: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms 61(4), 659\u2013680 (2012)","journal-title":"Numer. Algorithms"},{"key":"1609_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.3233\/FI-2016-1385","volume":"146","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B.: An arc-search interior point method in the $${\\cal{N}}_{\\infty }^-$$ neighborhood for symmetric optimization. Fundam. Inform. 146, 255\u2013269 (2016)","journal-title":"Fundam. Inform."},{"issue":"12","key":"1609_CR11","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1080\/00207160.2017.1283020","volume":"94","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the $${\\cal{N}}_{\\infty }^{-}$$ neighbourhood of the central path. Int. J. Comput. Math. 94(12), 2271\u20132282 (2017)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"1609_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3934\/naco.2018015","volume":"8","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B., Moslemi, M.: On the extension of an arc-search interior-point algorithm for semidefinite optimization. Numer. Algebra Control Optim. 8(2), 261\u2013275 (2018)","journal-title":"Numer. Algebra Control Optim."},{"key":"1609_CR13","doi-asserted-by":"publisher","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."},{"key":"1609_CR14","volume-title":"Handbook of Matrices","author":"H L\u00fctkepohl","year":"1996","unstructured":"L\u00fctkepohl, H.: Handbook of Matrices. Wiley, New York (1996)"},{"key":"1609_CR15","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"key":"1609_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-003-0451-1","volume":"97","author":"RDC Monteiro","year":"2003","unstructured":"Monteiro, R.D.C.: First-and second-order methods for semidefinite programming. Math. Program. 97, 209\u2013244 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"1609_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"RDC Monteiro","year":"1990","unstructured":"Monteiro, R.D.C., Adler, I., Resende, M.G.: A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15(2), 191\u2013214 (1990)","journal-title":"Math. Oper. Res."},{"key":"1609_CR18","first-page":"281","volume":"81","author":"RDC 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, 281\u2013299 (1998)","journal-title":"Math. Program."},{"key":"1609_CR19","doi-asserted-by":"crossref","unstructured":"Nesterov. Y.E., Nemirovskii, A.S.: Interior point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics, Vol. 13 SIAM, Philadelphia, USA; (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"1609_CR20","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)"},{"key":"1609_CR21","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1137\/S105262349630060X","volume":"8","author":"MJ Todd","year":"1998","unstructured":"Todd, M.J., Toh, K.C., T\u00fc\u00fcnc\u00fc, R.H.: On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8, 769\u2013796 (1998)","journal-title":"SIAM J. Optim."},{"key":"1609_CR22","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming. International Series in Operations Research and Management Science (27) Kluwer Academic Publishers, Boston, MA; (2000)","DOI":"10.1007\/978-1-4615-4381-7"},{"key":"1609_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-point Methods","author":"S Wright","year":"1997","unstructured":"Wright, S.: Primal-Dual Interior-point Methods. SIAM, Philadelphia (1997)"},{"key":"1609_CR24","unstructured":"Yang, Y.: Arc-search path-following interior-point algorithms for linear programming. Optimization Oline 2009; http:\/\/www.optimization-online.org\/ARCHIVE_CAT\/LINSDP\/2009.html"},{"key":"1609_CR25","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10957-013-0281-0","volume":"158","author":"Y Yang","year":"2013","unstructured":"Yang, Y.: A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming. J. Optim. Theory Appl. 158, 859\u2013873 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1609_CR26","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11075-018-0469-3","volume":"79","author":"Y Yang","year":"2018","unstructured":"Yang, Y.: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming. Numer. Algorithms 79(3), 957\u2013992 (2018)","journal-title":"Numer. Algorithms"},{"key":"1609_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/9781003042518","volume-title":"Arc-search techniques for interior-point methods","author":"Y Yang","year":"2020","unstructured":"Yang, Y.: Arc-search techniques for interior-point methods. CRC Press, Boca Raton (2020)"},{"issue":"4","key":"1609_CR28","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11590-017-1142-9","volume":"12","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Yamashita, M.: An arc-search $${\\cal{O}}(nL)$$ infeasible-interior-point algorithm for linear programming. Optim. Lett. 12(4), 781\u2013798 (2018)","journal-title":"Optim. Lett."},{"issue":"1\u20132","key":"1609_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H.: A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Appl. Math. Comput. 51(1\u20132), 209\u2013225 (2016)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"1609_CR30","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11590-016-0997-5","volume":"11","author":"X Yang","year":"2017","unstructured":"Yang, X., Liu, H., Zhang, Y.: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path. Optim. Lett. 11(1), 135\u2013152 (2017)","journal-title":"Optim. Lett."},{"key":"1609_CR31","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/0219030","volume":"19","author":"Y Ye","year":"1990","unstructured":"Ye, Y.: A class of projective transformations for linear programming. SIAM J. Comput. 19, 457\u2013466 (1990)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1609_CR32","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2), 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"key":"1609_CR33","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00186-010-0334-1","volume":"73","author":"J Zhang","year":"2011","unstructured":"Zhang, J., Zhang, K.: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming. Math. Meth. Oper. Res. 73, 75\u201390 (2011)","journal-title":"Math. Meth. Oper. Res."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01609-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-021-01609-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01609-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T22:56:58Z","timestamp":1630709818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-021-01609-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,13]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1609"],"URL":"https:\/\/doi.org\/10.1007\/s10915-021-01609-6","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2021,8,13]]},"assertion":[{"value":"29 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"89"}}