{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:21:15Z","timestamp":1717201275847},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"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. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s12190-024-02041-3","type":"journal-article","created":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T16:01:41Z","timestamp":1711209701000},"page":"2129-2148","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization"],"prefix":"10.1007","volume":"70","author":[{"given":"Billel","family":"Zaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamel","family":"Benterki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adnan","family":"Yassine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"2041_CR1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/401696","author":"Z Abo-Hammour","year":"2014","unstructured":"Abo-Hammour, Z., Abu Arqub, O., Momani, S., Shawagfeh, N., et al.: Optimization solution of Troesch\u2019s and Bratu\u2019s problems of ordinary type using novel continuous genetic algorithm. Discret. Dyn. Nat. Soc. (2014). https:\/\/doi.org\/10.1155\/2014\/401696","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"2041_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ins.2014.03.128","volume":"279","author":"OA Arqub","year":"2014","unstructured":"Arqub, O.A., Abo-Hammour, Z.: Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf. Sci. 279, 396\u2013415 (2014). https:\/\/doi.org\/10.1016\/j.ins.2014.03.128","journal-title":"Inf. Sci."},{"key":"2041_CR3","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/831657","author":"Z Abo-Hammour","year":"2013","unstructured":"Abo-Hammour, Z., Alsmadi, O., Momani, S., Abu Arqub, O., et al.: A genetic algorithm approach for prediction of linear dynamical systems. Math. Probl. Eng. (2013). https:\/\/doi.org\/10.1155\/2013\/831657","journal-title":"Math. Probl. Eng."},{"issue":"3","key":"2041_CR4","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1137\/S105262349630060","volume":"8","author":"MJ Todd","year":"1998","unstructured":"Todd, M.J., Toh, K.-C., T\u00fct\u00fcnc\u00fc, R.H.: On the nesterov-todd direction in semidefinite programming. SIAM J. Optim. 8(3), 769\u2013796 (1998). https:\/\/doi.org\/10.1137\/S105262349630060","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2041_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-006-0088-y","volume":"112","author":"K-C Toh","year":"2008","unstructured":"Toh, K.-C.: An inexact primal-dual path following algorithm for convex quadratic SDP. Math. Program. 112(1), 221\u2013254 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0088-y","journal-title":"Math. Program."},{"issue":"1","key":"2041_CR6","first-page":"135","volume":"3","author":"K Toh","year":"2007","unstructured":"Toh, K., Tutuncu, R., Todd, M.: Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems. Pacific J. Optim. 3(1), 135\u2013164 (2007)","journal-title":"Pacific J. Optim."},{"issue":"7\u20138","key":"2041_CR7","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1016\/j.na.2009.01.241","volume":"71","author":"G Wang","year":"2009","unstructured":"Wang, G., Bai, Y.: Primal-dual interior-point algorithm for convex quadratic semi-definite optimization. Nonlinear Anal. 71(7\u20138), 3389\u20133402 (2009). https:\/\/doi.org\/10.1016\/j.na.2009.01.241","journal-title":"Nonlinear Anal."},{"key":"2041_CR8","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). https:\/\/doi.org\/10.1137\/S1052623494269035","journal-title":"SIAM J. Optim."},{"key":"2041_CR9","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"key":"2041_CR10","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.amc.2013.12.070","volume":"231","author":"M Achache","year":"2014","unstructured":"Achache, M., Guerra, L.: A full nesterov-todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization. Appl. Math. Comput. 231, 581\u2013590 (2014). https:\/\/doi.org\/10.1016\/j.amc.2013.12.070","journal-title":"Appl. Math. Comput."},{"key":"2041_CR11","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 Publisher, Dordrecht (2002)"},{"key":"2041_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02903846","volume":"43","author":"J Nie","year":"2000","unstructured":"Nie, J., Yuan, Y.: A potential reduction algorithm for an extended sdp problem. Sci. Chin. Ser. 43, 35\u201346 (2000). https:\/\/doi.org\/10.1007\/BF02903846","journal-title":"Sci. Chin. Ser."},{"key":"2041_CR13","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s11075-010-9444-3","volume":"57","author":"G Wang","year":"2011","unstructured":"Wang, G., Zhu, D.: A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic sdo. Numer. Algorithms. 57, 537\u2013558 (2011). https:\/\/doi.org\/10.1007\/s11075-010-9444-3","journal-title":"Numer. Algorithms."},{"issue":"11","key":"2041_CR14","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1007\/s10114-012-0194-0","volume":"28","author":"MW Zhang","year":"2012","unstructured":"Zhang, M.W.: A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function. Acta Math. Sin. 28(11), 2313\u20132328 (2012). https:\/\/doi.org\/10.1007\/s10114-012-0194-0","journal-title":"Acta Math. Sin."},{"issue":"1","key":"2041_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.3934\/naco.2012.2.129","volume":"2","author":"L Zhang","year":"2012","unstructured":"Zhang, L., Xu, Y., Jin, Z.: An efficient algorithm for convex quadratic semi-definite optimization. Numer. Algebra Control Optim. 2(1), 129\u2013144 (2012). https:\/\/doi.org\/10.3934\/naco.2012.2.129","journal-title":"Numer. Algebra Control Optim."},{"key":"2041_CR16","volume-title":"Theory and Algorithms for Linear Optimization. An Interior Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.P.: Theory and Algorithms for Linear Optimization. An Interior Point Approach. Wiley, Chichester (1997)"},{"key":"2041_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-dual Interior Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-dual Interior Point Methods. Copyright by SIAM, Philadelphia (1997)"},{"key":"2041_CR18","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s10957-016-0895-0","volume":"170","author":"M Bouafia","year":"2016","unstructured":"Bouafia, M., Benterki, D., Yassine, A.: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term. J. Optim. Theory Appl. 170, 528\u2013545 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0895-0","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2041_CR19","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior point algorithms in linear programming. Adv. Model. Optim 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim"},{"key":"2041_CR20","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.cam.2016.05.008","volume":"312","author":"I Touil","year":"2017","unstructured":"Touil, I., Benterki, D., Yassine, A.: A feasible primal-dual interior point method for linear semidefinite programming. J. Comput. Appl. Math. 312, 216\u2013230 (2017). https:\/\/doi.org\/10.1016\/j.cam.2016.05.008","journal-title":"J. Comput. Appl. Math."},{"key":"2041_CR21","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.orl.2011.06.006","volume":"39","author":"L Zhang","year":"2011","unstructured":"Zhang, L., Xu, Y.: A full-newton step interior-point algorithm based on modified newton direction. Oper. Res. Lett. 39, 318\u2013322 (2011). https:\/\/doi.org\/10.1016\/j.orl.2011.06.006","journal-title":"Oper. Res. Lett."},{"key":"2041_CR22","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s11590-017-1171-4","volume":"12","author":"Z Darvay","year":"2018","unstructured":"Darvay, Z., Tak\u00e0cs, P.R.: New method for determining search directions for interior point algorithms in linear optimization. Optim. Lett. 12, 1099\u20131116 (2018). https:\/\/doi.org\/10.1007\/s11590-017-1171-4","journal-title":"Optim. Lett."},{"issue":"6","key":"2041_CR23","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1080\/02331934.2018.1432610","volume":"67","author":"PR Tak\u00e1cs","year":"2018","unstructured":"Tak\u00e1cs, P.R., Darvay, Z.: A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions. Optimization 67(6), 889\u2013905 (2018). https:\/\/doi.org\/10.1080\/02331934.2018.1432610","journal-title":"Optimization"},{"issue":"10","key":"2041_CR24","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1080\/01630563.2019.1598430","volume":"40","author":"B Kheirfam","year":"2019","unstructured":"Kheirfam, B.: A new search direction for full-newton step interior-point method in $$p^{\\ast }(k)$$-HLCP. Numer. Funct. Anal. Optim. 40(10), 1169\u2013118 (2019). https:\/\/doi.org\/10.1080\/01630563.2019.1598430","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"6","key":"2041_CR25","doi-asserted-by":"publisher","first-page":"3955","DOI":"10.1051\/ro\/2022192","volume":"56","author":"L Guerra","year":"2022","unstructured":"Guerra, L.: A class of new search directions for full-nt step feasible interior point method in semidefinite optimization. RAIRO Oper. Res. 56(6), 3955\u20133971 (2022). https:\/\/doi.org\/10.1051\/ro\/2022192","journal-title":"RAIRO Oper. Res."},{"issue":"1","key":"2041_CR26","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 technique. Eur. J. Oper. Res. 298(1), 25\u201335 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.08.039","journal-title":"Eur. J. Oper. Res."},{"key":"2041_CR27","doi-asserted-by":"crossref","unstructured":"Kheirfam, B.: A new full-nt step interior-point method for circular cone optimization. Croat. Oper. Res. Rev. 275\u2013287 (2019)","DOI":"10.17535\/crorr.2019.0023"},{"key":"2041_CR28","unstructured":"Kheirfam, B.: A new search direction for full-newton step infeasible interior-point method in linear optimization. arXiv:2102.07223 (2021)"},{"key":"2041_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y Nesterov","year":"1997","unstructured":"Nesterov, Y., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997). https:\/\/doi.org\/10.1287\/moor.22.1.1","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2041_CR30","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998). https:\/\/doi.org\/10.1137\/S1052623495290209","journal-title":"SIAM J. Optim."},{"key":"2041_CR31","unstructured":"Guerra, L.: M\u00e9thodes de Points Int\u00e9rieurs et Fonctions Noyaux Pour L\u2019optimisation Quadratique Semi-d\u00e9finie Convexe. Ferhat Abbas Setif-1 university, Ph.D thesis (2018)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02041-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02041-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02041-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T13:36:45Z","timestamp":1717162605000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02041-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2041"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02041-3","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,23]]},"assertion":[{"value":"19 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2024","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 declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}