{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:31:03Z","timestamp":1756463463265,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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,1]]},"DOI":"10.1007\/s10915-020-01384-w","type":"journal-article","created":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T17:02:42Z","timestamp":1609606962000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Second-Order Corrector Infeasible Interior-Point Method for Semidefinite Optimization Based on a Wide Neighborhood"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7928-2618","authenticated-orcid":false,"given":"B.","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nasrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"1384_CR1","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1360\/02ys0141","volume":"47","author":"W Ai","year":"2004","unstructured":"Ai, W.: Neighborhood-following algorithms for linear programming. Sci. China Ser. A 47, 812\u2013820 (2004)","journal-title":"Sci. China Ser. A"},{"issue":"2","key":"1384_CR2","doi-asserted-by":"crossref","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\u2013dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1384_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 semidefnite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"1384_CR4","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10957-018-1402-6","volume":"180","author":"S Asadi","year":"2019","unstructured":"Asadi, S., Mansouri, H., Darvay, Zs, Zangiabadi, M., Mahdavi-Amiri, N.: Large-neighborhood infeasible predictor\u2013corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones. J. Optim. Theory Appl. 180, 811\u2013829 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1384_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory: Studies in Applied Mathematics","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory: Studies in Applied Mathematics. SIAM, Philadelphia (1994)"},{"key":"1384_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming. Applied Optimization","author":"E de Klerk","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming. Applied Optimization. Kluwer, Dordrecht (2002)"},{"key":"1384_CR7","doi-asserted-by":"crossref","unstructured":"Faraut, J., kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, Oxford Science Publications (1994)","DOI":"10.1093\/oso\/9780198534778.001.0001"},{"key":"1384_CR8","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1080\/02331930903104382","volume":"59","author":"Z Feng","year":"2010","unstructured":"Feng, Z., Fang, L.: A wide neighborhood interior-point method with $$O(\\sqrt{n}L)$$ iteration-complexity bound for semidefinite programming. Optimization 59, 1235\u20131246 (2010)","journal-title":"Optimization"},{"key":"1384_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cam.2013.07.011","volume":"256","author":"Z Feng","year":"2014","unstructured":"Feng, Z., Fang, L.: A new $$O(\\sqrt{n}L)$$-iteration predictor\u2013corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256, 65\u201376 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"1384_CR10","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)"},{"issue":"4","key":"1384_CR11","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(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"1384_CR12","first-page":"33","volume":"152","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: A predictor\u2013corrector infeasible-interior-point algorithm for semidefinite optimization in a wide neighborhood. Fund. Inform. 152, 33\u201350 (2017)","journal-title":"Fund. Inform."},{"issue":"2","key":"1384_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10998-017-0231-y","volume":"76","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B., Chitsaz, M.: Polynomial convergence of two higher order interior-point methods for $$P_*(\\kappa )$$-LCP in a wide neighborhood of the central path. Period. Math. Hung. 76(2), 243\u2013264 (2018)","journal-title":"Period. Math. Hung."},{"key":"1384_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s10998-018-00271-0","volume":"79","author":"B Kheirfam","year":"2019","unstructured":"Kheirfam, B., Haghighi, M.: A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function. Period. Math. Hung. 79, 94\u2013105 (2019)","journal-title":"Period. Math. Hung."},{"key":"1384_CR15","first-page":"327","volume":"153","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B., Mohamadi-sangachin, M.: A wide neighborhood second-order predictor\u2013corrector interior-point algorithm for semidefinite optimization with modified corrector directions. Fund. Inform. 153, 327\u2013346 (2017)","journal-title":"Fund. Inform."},{"key":"1384_CR16","doi-asserted-by":"crossref","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, Berlin (1991)","DOI":"10.1007\/3-540-54509-3"},{"key":"1384_CR17","doi-asserted-by":"crossref","first-page":"2853","DOI":"10.1137\/080729311","volume":"8","author":"Y Li","year":"2010","unstructured":"Li, Y., Terlaky, T.: A new class of large neighborhood path-following interior-point algorithms for semidefinite optimization with $${\\cal{O}}\\big (\\sqrt{n}\\log (\\frac{tr(X^{0}S^{0})}{\\varepsilon })\\big )$$ iteration complexity. SIAM J. Optim. 8, 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1384_CR18","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s10957-013-0303-y","volume":"158","author":"H Liu","year":"2013","unstructured":"Liu, H., Yang, X., Liu, C.: A new wide neighborhood primal\u2013dual infeasible-interior-point method for symmetric cone programming. J. Optim. Theory Appl. 158(3), 796\u2013815 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1384_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00186-012-0379-4","volume":"75","author":"C Liu","year":"2012","unstructured":"Liu, C., Liu, H.: A new second-order corrector interior-point algorithm for semidefinit programming. Math. Meth. Oper. Res. 75, 165\u2013183 (2012)","journal-title":"Math. Meth. Oper. Res."},{"key":"1384_CR20","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: Om the implementation of a primal\u2013dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"1384_CR21","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal\u2013dual path-following algorithms for semidefenite programming. SIAM J. Optim. 7, 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"key":"1384_CR22","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S1052623496308618","volume":"8","author":"RDC Monteiro","year":"1998","unstructured":"Monteiro, R.D.C.: Polynomial convergence of primal\u2013dual algorithms for semidefnite programming based on Monteiro and Zhang family of directions. SIAM J. Optim. 8, 797\u2013812 (1998)","journal-title":"SIAM J. Optim."},{"key":"1384_CR23","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 semidefnite programming. Math. Program. 97, 209\u2013244 (2003)","journal-title":"Math. Program."},{"key":"1384_CR24","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\u2013dual path-following interior-point algorithms for semidefinite programming. Math. Program. 81, 281\u2013299 (1998)","journal-title":"Math. Program."},{"key":"1384_CR25","volume-title":"Interior Point Methods in Convex Programming: Theory and Applications","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovski, A.S.: Interior Point Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia (1994)"},{"key":"1384_CR26","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal\u2013dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1384_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"Potra, F.A.: Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity. SIAM J. Optim. 24(1), 1\u201328 (2014)","journal-title":"SIAM J. Optim."},{"key":"1384_CR28","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: A superlinearly convergent primal\u2013dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8, 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"key":"1384_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal\u2013dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"key":"1384_CR30","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4, 208\u2013227 (1994)","journal-title":"SIAM J. Optim."},{"key":"1384_CR31","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang, Y., Zhang, D.: On polynomiality of the Mehrotra-type predictor\u2013corrector interior-point algorithms. Math. Program. 68, 303\u2013318 (1995)","journal-title":"Math. Program."},{"key":"1384_CR32","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1007\/s11424-012-0317-9","volume":"25","author":"MW Zhang","year":"2012","unstructured":"Zhang, M.W.: A second order Mehrotra-type predictor\u2013corrector algorithm for semidefinite optimization. J. Syst. Sci. Complex. 25, 1108\u20131121 (2012)","journal-title":"J. Syst. Sci. Complex."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01384-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-020-01384-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01384-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T15:48:30Z","timestamp":1724168910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-020-01384-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["1384"],"URL":"https:\/\/doi.org\/10.1007\/s10915-020-01384-w","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"12 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}