{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:14:37Z","timestamp":1761808477456,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"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. Appl. Math. Comput."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s12190-021-01579-w","type":"journal-article","created":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T12:02:43Z","timestamp":1623412963000},"page":"1365-1385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7928-2618","authenticated-orcid":false,"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naser","family":"Osmanpour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,11]]},"reference":[{"issue":"1","key":"1579_CR1","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":"1579_CR2","unstructured":"Alizadeh, F.: Combinatorial optimizationwith interior-point methods and semi-definite matrices. Computer Science Department, University of Minnesota, Minneapolis, Ph.D.thesis (1991)"},{"issue":"2","key":"1579_CR3","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":"1579_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S.E., El. Ghaoui, L., Feron, E., Balakrishnan, V.: linear matrix inequalities in system and control theory. Studies in Applied Mathematics, vol. 15. SIAM, Philadelphia, USA (1994)","DOI":"10.1137\/1.9781611970777"},{"key":"1579_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 Acadamic Publishers, Dordrecht (2002)"},{"key":"1579_CR6","doi-asserted-by":"publisher","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 $${\\cal{O}}(\\sqrt{n}L)$$-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256, 65\u201376 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"1579_CR7","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/S1052623401390793","volume":"12","author":"M Halicka","year":"2002","unstructured":"Halicka, M., De Klerk, E., Roos, C.: On the convergence of the central path in semidefinite optimization. SIAM J. Optim. 12(4), 1090\u20131099 (2002)","journal-title":"SIAM J. Optim."},{"key":"1579_CR8","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., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1579_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02192304","volume":"84","author":"J Ji","year":"1995","unstructured":"Ji, J., Potra, F.A., Huang, S.: A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence. J. Optim. Theory Appl. 84(1), 187\u2013199 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1579_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3233\/FI-2017-1543","volume":"153","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B., Mohamadi-Sangachin, M.: A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions. Fundam. Inform. 153(4), 327\u2013346 (2017)","journal-title":"Fundam. Inform."},{"issue":"2","key":"1579_CR11","first-page":"1","volume":"6","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B., Chitsaz, M.: Corrector-predictor arc-search interior-point algorithm for $$P_*(\\kappa )$$-LCP acting in a wide neighborhood of the central path. Iranian J. Oper. Res. 6(2), 1\u201318 (2015)","journal-title":"Iranian J. Oper. Res."},{"issue":"1","key":"1579_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.3233\/FI-2017-1511","volume":"152","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: A predictor-corrector infeasible-interior-point algorithm for semidefinite optimization in a wide neighborhood. Fundam. Inform. 152(1), 33\u201350 (2017)","journal-title":"Fundam. Inform."},{"issue":"1","key":"1579_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(1), 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"key":"1579_CR14","doi-asserted-by":"publisher","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."},{"key":"1579_CR15","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"1579_CR16","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":"1579_CR17","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 (PA) (1994)"},{"key":"1579_CR18","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-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1579_CR19","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":"1579_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10107-003-0472-9","volume":"100","author":"FA 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 $${\\cal{O}}(\\sqrt{n}L)$$-iteration complexity. Math. Program. 100, 317\u2013337 (2004)","journal-title":"Math. Program."},{"key":"1579_CR21","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/s10957-016-0927-9","volume":"170","author":"M Sayadi Shahraki","year":"2016","unstructured":"Sayadi Shahraki, M., Mansouri, H., Zangiabadi, M.: A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighborhood. J. Optim. Theory Appl. 170, 546\u2013561 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1579_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3-a Matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1579_CR23","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.E.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"1579_CR24","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)"},{"issue":"5","key":"1579_CR25","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1080\/00207160.2013.827784","volume":"91","author":"XM Yang","year":"2014","unstructured":"Yang, X.M., Liu, H.W., Zhang, Y.K.: A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semidefinite programming. Int. J. Comput. Math. 91(5), 1082\u20131096 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"1579_CR26","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1080\/00207160.2013.827784","volume":"91","author":"X Yang","year":"2014","unstructured":"Yang, X., Liu, H., Zhang, Y.: A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighborhood for semidefinite programming. Int. J. Comput. Math. 91, 1082\u20131096 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"1579_CR27","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y Ye","year":"1993","unstructured":"Ye, Y., Anstreicher, K.: On quadratic and $${\\cal{O}}(\\sqrt{n}L)$$ convergence of predictor-corrector algorithm for LCP. Math. Program. 62, 537\u2013551 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"1579_CR28","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-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2), 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1579_CR29","first-page":"353","volume":"23","author":"J Zhang","year":"2003","unstructured":"Zhang, J., Zhang, X.: A predictor-corrector interior-point algorithm for covex quadratic programming. J. Sys. Sci. Math. Sci. 23(3), 353\u2013366 (2003)","journal-title":"J. Sys. Sci. Math. Sci."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-021-01579-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-021-01579-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-021-01579-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T17:34:09Z","timestamp":1647538449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-021-01579-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,11]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1579"],"URL":"https:\/\/doi.org\/10.1007\/s12190-021-01579-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2021,6,11]]},"assertion":[{"value":"11 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}