{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:08Z","timestamp":1740123548566,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10915-023-02137-1","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T07:35:58Z","timestamp":1676619358000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Corrector-Predictor Interior-Point Method With New Search Direction for Semidefinite Optimization"],"prefix":"10.1007","volume":"95","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":[[2023,2,15]]},"reference":[{"issue":"1","key":"2137_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":"2137_CR2","unstructured":"Alizadeh, F.: Combinatorial optimization with interior-point methods and semi-definite matrices. Ph.D. Thesis, Computer Science Department, University of Minnesota, Minneapolis (1991)"},{"issue":"4","key":"2137_CR3","doi-asserted-by":"publisher","first-page":"891","DOI":"10.3934\/jimo.2011.7.891","volume":"7","author":"Y Bai","year":"2011","unstructured":"Bai, Y., Zhang, L.: 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":"2137_CR4","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)"},{"issue":"1","key":"2137_CR5","first-page":"51","volume":"5","author":"Zs Darvay","year":"2003","unstructured":"Darvay, Zs.: New interior-point algorithms in linear programming. Adv. Model. Optim., 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim.,"},{"key":"2137_CR6","unstructured":"Darvay, Z.: A new predictor-corrector algorithm for linear programming. Alkalmaz. Mat. Lapok 22, 135\u2013161 (2005). (in Hungarian)"},{"issue":"3","key":"2137_CR7","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1137\/19M1248972","volume":"30","author":"Zs Darvay","year":"2020","unstructured":"Darvay, Zs., Ill\u00e9s, T., Povh, J., Rig\u00f3, P..R.: Feasible corrector-predictor interior-point algorithm for $$P_*(\\kappa )$$-linear complementarity problems based on a new search direction. SIAM J. Optim. 30(3), 2628\u20132658 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2137_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2021.08.039","volume":"298","author":"Z Darvay","year":"2022","unstructured":"Darvay, Z., Ill\u00e9s, T., Rig\u00f3, P.R.: Predictor-corrector interior-point algorithm for $$P_*(\\kappa )$$-linear complementarity problems based on a new type of algebraic equivalent transformation techniqe. Eur. J. Oper. Res. 298(1), 25\u201335 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2137_CR9","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s11590-017-1171-4","volume":"12","author":"Zs Darvay","year":"2018","unstructured":"Darvay, Zs., Tak\u00e1cs, P. R.: New method for determining search directions for interior-point algorithms in linear optimization. Optim. Lett. 12(5), 1099\u20131116 (2018)","journal-title":"Optim. Lett."},{"issue":"1","key":"2137_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10998-016-0119-2","volume":"73","author":"Zs Darvay","year":"2016","unstructured":"Darvay, Zs., Papp, I. M., Tak\u00e1cs, P. R.: Complexity analysis of a full-Newton step interior-point method for linear optimization. Period. Math. Hung. 73(1), 27\u201342 (2016)","journal-title":"Period. Math. Hung."},{"issue":"3","key":"2137_CR11","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s10100-019-00622-3","volume":"28","author":"Zs Darvay","year":"2020","unstructured":"Darvay, Zs., Ill\u00e9s, T., Kheirfam, B., Rig\u00f3, P. R.: A corrector-predictor interior-point method with new search direction for linear optimization. Cent. Eur. J. Oper. Res. 28(3), 1123\u20131140 (2020)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"2137_CR12","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)"},{"issue":"4","key":"2137_CR13","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":"2137_CR14","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."},{"issue":"1\u20132","key":"2137_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0167-6377(98)00018-2","volume":"23","author":"J Jiang","year":"1998","unstructured":"Jiang, J.: A long step primal-dual path following method for semidefinite programming. Oper. Res. Lett. 23(1\u20132), 53\u201362 (1998)","journal-title":"Oper. Res. Lett."},{"key":"2137_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s11075-013-9738-3","volume":"66","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A predictor-corrector interior-point algorithm for $$P_*(\\kappa )$$-horizontal linear complementarity problem. Numer. Algorithms 66, 349\u2013361 (2014)","journal-title":"Numer. Algorithms"},{"issue":"12","key":"2137_CR17","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1080\/00207160.2015.1085028","volume":"93","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B.: A corrector-predictor path-following method for second-order cone optimization. Int. J. Comput. Math. 93(12), 2064\u20132078 (2016)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"2137_CR18","doi-asserted-by":"publisher","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."},{"issue":"4","key":"2137_CR19","doi-asserted-by":"publisher","first-page":"1750070","DOI":"10.1142\/S179355711750070X","volume":"10","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: New complexity analysis of a full Nesterov\u2013Todd step interior-point method for semidefinite optimization. Asian-Eur. J. Math. 10(4), 1750070 (2017)","journal-title":"Asian-Eur. J. Math."},{"issue":"1","key":"2137_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s12190-017-1128-x","volume":"57","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B.: An infeasible interior point method for the monotone SDLCP based on a transformation of the central path. J. Appl. Math. Comput. 57(1), 685\u2013702 (2018)","journal-title":"J. Appl. Math. Comput."},{"key":"2137_CR21","doi-asserted-by":"crossref","unstructured":"Kheirfam, B., Hosseinpour, N., Abedi, H.: A new corrector-predictor interior-point method for symmetric cone optimization. Period. Math. Hung. 85(2), 312\u2013327 (2022)","DOI":"10.1007\/s10998-021-00443-5"},{"key":"2137_CR22","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":"2137_CR23","doi-asserted-by":"crossref","unstructured":"Lewis, A.S., Overton, M.L.: Eigenvalue optimization. Acta Numer. 5, 149\u2013190 (1996)","DOI":"10.1017\/S0962492900002646"},{"issue":"2","key":"2137_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11075-009-9270-7","volume":"52","author":"H Mansouri","year":"2009","unstructured":"Mansouri, H., Roos, C.: A new full-Newton step $$O(n)$$ infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52(2), 225\u2013255 (2009)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"2137_CR25","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"2137_CR26","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":"2137_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"issue":"1","key":"2137_CR28","doi-asserted-by":"publisher","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), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"2137_CR29","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."},{"key":"2137_CR30","unstructured":"Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach, 2nd edn. Springer (2006)"},{"key":"2137_CR31","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.amc.2009.06.034","volume":"215","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov\u2013Todd step. Appl. Math. Comput. 215, 1047\u20131061 (2009)","journal-title":"Appl. Math. Comput."},{"key":"2137_CR32","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.jmaa.2008.12.016","volume":"353","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: A new primal-dual path-following interior-point algorithm for semidefinite optimization. J. Math. Anal. Appl. 353, 339\u2013349 (2009)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"2137_CR33","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1007\/s10957-012-0013-x","volume":"154","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization. J. Optim. Theory Appl. 154(3), 966\u2013985 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2137_CR34","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s10957-014-0619-2","volume":"165","author":"GQ Wang","year":"2015","unstructured":"Wang, G.Q., Bai, Y.Q., Gao, X.Y., Wang, D.Z.: Improved complexity analysis of full Nesterov\u2013Todd step interior-point methods for semidefinite optimization. J. Optim. Theory Appl. 165(1), 242\u2013262 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2137_CR35","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s10957-014-0696-2","volume":"166","author":"GQ Wang","year":"2015","unstructured":"Wang, G.Q., Kong, L.C., Tao, J.Y., Lesaja, G.: Improved complexity analysis of full Nesterov\u2013Todd step feasible interior-point method for symmetric optimization. J. Optim. Theory Appl. 166(2), 588\u2013604 (2015)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02137-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02137-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02137-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T01:48:30Z","timestamp":1701913710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02137-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2137"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02137-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"assertion":[{"value":"21 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}