{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:56:46Z","timestamp":1760147806086,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>In rotated quadratic cone programming problems, we minimize a linear objective function over the intersection of an affine linear manifold with the Cartesian product of rotated quadratic cones. In this paper, we introduce the rotated quadratic cone programming problems as a \u201cself-made\u201d class of optimization problems. Based on our own Euclidean Jordan algebra, we present a glimpse of the duality theory associated with these problems and develop a special-purpose primal\u2013dual interior-point algorithm for solving them. The efficiency of the proposed algorithm is shown by providing some numerical examples.<\/jats:p>","DOI":"10.3390\/computation11030050","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T02:27:25Z","timestamp":1677810445000},"page":"50","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algebraic-Based Primal\u2013Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization"],"prefix":"10.3390","volume":"11","author":[{"given":"Karima","family":"Tamsaouete","sequence":"first","affiliation":[{"name":"Department of Mathematics, The University of Jordan, Amman 11942, Jordan"}]},{"given":"Baha","family":"Alzalg","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The University of Jordan, Amman 11942, Jordan"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Montoya, O., Gil-Gonz\u00e1lez, W., and Garc\u00e9s, A. (2022). On the conic convex approximation to locate and size fixed-step capacitor banks in distribution networks. Computation, 10.","DOI":"10.3390\/computation10020032"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10589-018-0045-8","article-title":"A primal-dual interior-point method based on various selections of displacement step for symmetric optimization","volume":"72","author":"Alzalg","year":"2019","journal-title":"Comput. Optim. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., and Nemirovskii, A. (1994). Interior-Point Polynomial Algorithms in Convex Programming, SIAM.","DOI":"10.1137\/1.9781611970791"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","article-title":"Self-scaled barriers and interior-point methods for convex programming","volume":"22","author":"Nesterov","year":"1997","journal-title":"Math. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1007\/s40565-019-0525-6","article-title":"A convex relaxation approach for power flow problem","volume":"7","author":"Manshadi","year":"2019","journal-title":"J. Mod. Power Syst. Clean Energy"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/JSYST.2019.2913133","article-title":"A distributed convex relaxation approach to solve the power flow problem","volume":"14","author":"Manshadi","year":"2019","journal-title":"IEEE Syst. J."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","article-title":"Second-order cone programming","volume":"95","author":"Alizadeh","year":"2003","journal-title":"Math. Program."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1080\/02331934.2017.1360888","article-title":"Elliptic cone optimization and primal\u2013dual path-following algorithms","volume":"66","author":"Alzalg","year":"2017","journal-title":"Optimization"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2533","DOI":"10.1007\/s00521-018-3937-8","article-title":"A GA based hierarchical feature selection approach for handwritten word recognition","volume":"32","author":"Malakar","year":"2020","journal-title":"Neural. Comput. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Bacanin, N., Stoean, R., Zivkovic, M., Petrovic, A., Rashid, T.A., and Bezdan, T. (2021). Performance of a novel chaotic firefly algorithm with enhanced exploration for tackling global optimization problems: Application for dropout regularization. Mathematics, 9.","DOI":"10.3390\/math9212705"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Tuba, E., and Bacanin, N. (2015, January 24\u201326). An algorithm for handwritten digit recognition using projection histograms and SVM classifier. Proceedings of the 2015 23rd Telecommunications Forum Telfor (TELFOR), Belgrade, Serbia.","DOI":"10.1109\/TELFOR.2015.7377507"},{"key":"ref_12","unstructured":"Karmarkar, N. (May, January 30). A new polynomial-time algorithm for linear programming. Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, Washington, DC, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/moor.21.4.860","article-title":"Barrier functions in interior point methods","volume":"21","year":"1996","journal-title":"Math. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Faraut, J. (1994). Analysis on Symmetric Cones, Oxford Mathematical Monographs.","DOI":"10.1093\/oso\/9780198534778.001.0001"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0962492901000071","article-title":"Semidefinite optimization","volume":"10","author":"Todd","year":"2001","journal-title":"Acta Numer."},{"key":"ref_16","unstructured":"Alzalg, B. (2022). Combinatorial and Algorithmic Mathematics: From Foundation to Optimization, Kindle Direct Publishing."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s10957-013-0428-z","article-title":"Homogeneous self-dual algorithms for stochastic second-order cone programming","volume":"163","author":"Alzalg","year":"2014","journal-title":"J. Optim. Theory Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.amc.2015.05.014","article-title":"Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming","volume":"265","author":"Alzalg","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s11590-019-01404-1","article-title":"A logarithmic barrier interior-point method based on majorant functions for second-order cone programming","volume":"14","author":"Alzalg","year":"2020","journal-title":"Optim. Lett."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/s10957-018-1445-8","article-title":"An infeasible interior-point algorithm for stochastic second-order cone optimization","volume":"181","author":"Alzalg","year":"2019","journal-title":"J. Optim. Theory Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"4995","DOI":"10.1109\/ACCESS.2019.2962840","article-title":"Volumetric barrier cutting plane algorithms for stochastic linear semi-infinite optimization","volume":"8","author":"Alzalg","year":"2019","journal-title":"IEEE Access"},{"key":"ref_22","first-page":"65","article-title":"Primal-dual path-following algorithms for circular programming","volume":"2","author":"Alzalg","year":"2017","journal-title":"Commun. Comb. Optim."},{"key":"ref_23","unstructured":"Kojima, M., Mizuno, S., and Yoshise, A. (1989). Progress in Math. Program, Springer."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","article-title":"Interior Path Following Primal-Dual Algorithms. Part I: Linear Programming","volume":"44","author":"Monteiro","year":"1989","journal-title":"Math. Program."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1080\/02331934.2018.1533553","article-title":"Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming","volume":"67","author":"Alzalg","year":"2018","journal-title":"Optimization"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","article-title":"An O(n3L) Primal interior point algorithm for convex quadratic programming","volume":"49","author":"Goldfarb","year":"1991","journal-title":"Math. Program."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/02331939608844216","article-title":"Properties of primal interior point methods for QP","volume":"37","author":"Tiande","year":"1996","journal-title":"Optimization"},{"key":"ref_28","unstructured":"Alzalg, B., Tamsaouete, K., Benakkouche, L., and Ababneh, A. (2023, January 31). The Jordan Algebraic Structure of the Rotated Quadratic Cone. Submitted for Publication. Available online: https:\/\/optimization-online.org\/wp-content\/uploads\/2023\/01\/RQC.pdf."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580085","article-title":"A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming","volume":"81","author":"Monteiro","year":"1998","journal-title":"Math. Program."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","article-title":"Extension of primal-dual interior point algorithms to symmetric cones","volume":"96","author":"Schmieta","year":"2003","journal-title":"Math. Program."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","article-title":"An interior-point method for semidefinite programming","volume":"6","author":"Helmberg","year":"1996","journal-title":"SIAM J. Optim."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","article-title":"Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices","volume":"7","author":"Kojima","year":"1997","journal-title":"SIAM J. Optim."},{"key":"ref_33","unstructured":"Grant, M., Boyd, S., and Ye, Y. (2009). CVX: Matlab Software for Disciplined Convex Programming (Webpage and Software), CVX Research, Inc."},{"key":"ref_34","unstructured":"Mosek ApS (2019). User\u2019s Guide and Reference Manual, Mosek ApS. Version 4."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/3\/50\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:46:15Z","timestamp":1760121975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/3\/50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":34,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["computation11030050"],"URL":"https:\/\/doi.org\/10.3390\/computation11030050","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2023,3,2]]}}}