{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:03Z","timestamp":1740145143422,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006347","name":"Universitatea Babe\u0219-Bolyai","doi-asserted-by":"publisher","award":["AGC32881\/18.06.2021"],"award-info":[{"award-number":["AGC32881\/18.06.2021"]}],"id":[{"id":"10.13039\/501100006347","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry for Culture and Innovation from the source of the National Research, Development and Innovation Fund","award":["\u00daNKP-22-4"],"award-info":[{"award-number":["\u00daNKP-22-4"]}]},{"name":"Ministry of Culture and Innovation of Hungary from the National Research, Development and Innovation Fund","award":["PD_22 funding scheme","project no. 142154"],"award-info":[{"award-number":["PD_22 funding scheme","project no. 142154"]}]},{"DOI":"10.13039\/100018253","name":"Corvinus University of Budapest","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100018253","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We generalize a primal-dual interior-point algorithm (IPA) proposed recently in (Ill\u00e9s T, Rig\u00f3 PR, T\u00f6r\u00f6k R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) to <jats:inline-formula><jats:alternatives><jats:tex-math>$$P_*(\\kappa )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>P<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mrow\/>\n                        <mml:mo>\u2217<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:msub>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>\u03ba<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-horizontal linear complementarity problems (LCPs) over Cartesian product of symmetric cones. The algorithm is based on the algebraic equivalent transformation (AET) technique with a new class of AET functions. The new class is a modification of the class of AET functions proposed in (Ill\u00e9s T, Rig\u00f3 PR, T\u00f6r\u00f6k R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) where only two conditions are used as opposed to three used in (Ill\u00e9s T, Rig\u00f3 PR, T\u00f6r\u00f6k R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022). Furthermore, the algorithm is a feasible algorithm that uses full Nesterov-Todd steps, hence, no calculation of step-size is necessary. Nevertheless, we prove that the proposed IPA has the iteration bound that matches the best known iteration bound for IPAs solving these types of problems.<\/jats:p>","DOI":"10.1007\/s11590-023-02020-w","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T05:01:46Z","timestamp":1686632506000},"page":"615-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1094-9837","authenticated-orcid":false,"given":"Zsolt","family":"Darvay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3867-0304","authenticated-orcid":false,"given":"Petra Ren\u00e1ta","family":"Rig\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,13]]},"reference":[{"key":"2020_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1080\/10556789708805657","volume":"7","author":"M Anitescu","year":"1997","unstructured":"Anitescu, M., Le\u0161aja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Methods Softw. 7, 265\u2013290 (1997)","journal-title":"Optim. Methods Softw."},{"key":"2020_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1080\/10556788.2020.1734803","volume":"37","author":"S Asadi","year":"2022","unstructured":"Asadi, S., Mahdavi-Amiri, N., Darvay, Zs., Rig\u00f3, P.R.: Full-NT step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function. Optim. Methods Sofw. 37, 192\u2013213 (2022)","journal-title":"Optim. Methods Sofw."},{"key":"2020_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/02331934.2016.1267732","volume":"66","author":"S Asadi","year":"2017","unstructured":"Asadi, S., Mansouri, H., Darvay, Zs.: An infeasible full-NT step IPM for $$P_*(\\kappa )$$ horizontal linear complementarity problem over Cartesian product of symmetric cones. Optimization 66, 225\u2013250 (2017)","journal-title":"Optimization"},{"key":"2020_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/10556788.2015.1058795","volume":"31","author":"S Asadi","year":"2016","unstructured":"Asadi, S., Mansouri, H., Darvay, Zs., Zangiabadi, M.: On the $$P_*(\\kappa )$$ horizontal linear complementarity problems over Cartesian product of symmetric cones. Optim. Methods Softw. 31, 233\u2013257 (2016)","journal-title":"Optim. Methods Softw."},{"key":"2020_CR5","doi-asserted-by":"publisher","first-page":"2031","DOI":"10.1080\/02331934.2018.1512604","volume":"67","author":"S Asadi","year":"2018","unstructured":"Asadi, S., Mansouri, H., Le\u0161aja, G., Zangiabadi, M.: A long-step interior-point algorithm for symmetric cone Cartesian $$P_*(\\kappa )$$-HLCP. Optimization 67, 2031\u20132060 (2018)","journal-title":"Optimization"},{"key":"2020_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15, 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"key":"2020_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF00940344","volume":"60","author":"S-J Chung","year":"1989","unstructured":"Chung, S.-J.: NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60, 393\u2013399 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"2020_CR8","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Zs.: New interior-point algorithms in linear programming. Adv. Model Optim. 5, 51\u201392 (2003)","journal-title":"Adv. Model Optim."},{"key":"2020_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11590-020-01612-0","volume":"15","author":"Zs Darvay","year":"2021","unstructured":"Darvay, Zs., Ill\u00e9s, T., Majoros, Cs.: Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. Optim. Lett. 15, 357\u2013376 (2021)","journal-title":"Optim. Lett."},{"key":"2020_CR10","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.: Predictor-corrector interior-point algorithm for sufficient linear complementarity problems based on a new search direction. SIAM J. Optim. 30, 2628\u20132658 (2020)","journal-title":"SIAM J. Optim."},{"key":"2020_CR11","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, 27\u201342 (2016)","journal-title":"Period. Math. Hung."},{"key":"2020_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones Oxford Mathematical Monographs","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, Oxford Science Publications, New York (1994)"},{"key":"2020_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86, 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2020_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11590-018-1241-2","volume":"13","author":"M Haddou","year":"2019","unstructured":"Haddou, M., Migot, T., Omer, J.: A generalized direction in interior point method for monotone linear complementarity problems. Optim. Lett. 13(1), 35\u201353 (2019)","journal-title":"Optim. Lett."},{"key":"2020_CR15","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/j.ejor.2005.08.031","volume":"181","author":"T Ill\u00e9s","year":"2007","unstructured":"Ill\u00e9s, T., Nagy, M.: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems. Eur. J. Oper. Res. 181, 1097\u20131111 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"2020_CR16","first-page":"1","volume":"5","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: Polynomial interior point algorithms for general linear complementarity problems. Alg. Oper. Res. 5, 1\u201312 (2010)","journal-title":"Alg. Oper. Res."},{"key":"2020_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: A polynomial path-following interior point algorithm for general linear complementarity problems. J. Global. Optim. 47, 329\u2013342 (2010)","journal-title":"J. Global. Optim."},{"key":"2020_CR18","unstructured":"Ill\u00e9s, T., Rig\u00f3, P.R., T\u00f6r\u00f6k, R.: Unified approach of primal-dual interior-point algorithms for a new class of AET functions, Corvinus Econ. Work. Paper. 2022\/02 (2022)"},{"key":"2020_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1051\/ro\/2016020","volume":"51","author":"M Karimi","year":"2017","unstructured":"Karimi, M., Luo, S., Tuncel, L.: Primal-dual entropy-based interior-point algorithms for linear optimization. RAIRO-Oper. Res. 51, 299\u2013328 (2017)","journal-title":"RAIRO-Oper. Res."},{"key":"2020_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.17535\/crorr.2016.0019","volume":"7","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B., Haghighi, M.: A full-Newton step feasible interior-point algorithm for $${P}_{*}(\\kappa )$$-LCP based on a new search direction. Croat. Oper. Res. Rev. 7, 277\u2013290 (2016)","journal-title":"Croat. Oper. Res. Rev."},{"issue":"5","key":"2020_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0167-6377(91)90010-M","volume":"10","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A unified approach to interior point algorithms for linear complementarity problems. Oper. Res. Lett. 10(5), 247\u2013254 (1991)","journal-title":"Oper. Res. Lett."},{"key":"2020_CR22","first-page":"2994","volume":"21","author":"G Le\u0161aja","year":"2011","unstructured":"Le\u0161aja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for $$P_*(\\kappa )$$-LCP. SIAM J. Optim. 21, 2994\u20133013 (2011)","journal-title":"SIAM J. Optim."},{"key":"2020_CR23","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1080\/10556788.2012.670858","volume":"27","author":"G Le\u0161aja","year":"2012","unstructured":"Le\u0161aja, G., Wang, G.Q., Zhu, D.T.: Interior-point methods for Cartesian $$P_*(\\kappa )$$-linear complementarity problems over symmetric cones based on the eligible kernel functions. Optim. Methods Softw. 27, 827\u2013843 (2012)","journal-title":"Optim. Methods Softw."},{"key":"2020_CR24","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1007\/s11425-008-0174-0","volume":"52","author":"ZQ Luo","year":"2009","unstructured":"Luo, Z.Q., Xiu, N.: Path-following interior point algorithms for the Cartesian $$P_{*}(\\kappa )$$-LCP over symmetric cones. Sci. China Ser. A Math. 52, 1769\u20131784 (2009)","journal-title":"Sci. China Ser. A Math."},{"key":"2020_CR25","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1080\/02331934.2015.1062011","volume":"65","author":"N Mohammadi","year":"2015","unstructured":"Mohammadi, N., Mansouri, H., Zangiabadi, M., Asadi, S.: A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian $$P_*(\\kappa )$$ horizontal linear complementarity problem over symmetric cones. Optimization 65, 539\u2013565 (2015)","journal-title":"Optimization"},{"key":"2020_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01580085","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":"2020_CR27","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity. Princeton University Press, Princeton, NJ, A New Paradigm for Primal-Dual Interior-Point Algorithms (2002)"},{"key":"2020_CR28","unstructured":"Rig\u00f3, P.R.: New trends in algebraic equivalent transformation of the central path and its applications, PhD thesis, Budapest University of Technology and Economics, Institute of Mathematics, Hungary (2020)"},{"key":"2020_CR29","first-page":"85","volume-title":"Proceeding of the 8th VOCAL Optimization Conference: Advanced Algorithms (short papers)","author":"PR Rig\u00f3","year":"2018","unstructured":"Rig\u00f3, P.R.: New trends in interior-point algorithms. In: Friedler, F. (ed.) Proceeding of the 8th VOCAL Optimization Conference: Advanced Algorithms (short papers), pp. 85\u201390. Hungary, Esztergom (2018)"},{"key":"2020_CR30","volume-title":"Theory and Algorithms for Linear Optimization","author":"C Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, JPh.: Theory and Algorithms for Linear Optimization. Springer, New York (2005)"},{"key":"2020_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96, 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"2020_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Linear Algebra Appl. 312, 135\u2013154 (2000)","journal-title":"Linear Algebra Appl."},{"key":"2020_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008637929927","volume":"8","author":"L Tuncel","year":"1997","unstructured":"Tuncel, L., Todd, M.J.: On the interplay among entropy, variable metrics and potential functions in interior-point algorithms. Comput. Optim. Appl. 8, 5\u201319 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"2020_CR34","unstructured":"Vieira, M.V.C.: Jordan algebraic approach to symmetric optimization, PhD thesis, Delf University of Technology, The Netherlands (2007)"},{"key":"2020_CR35","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, 966\u2013985 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"2020_CR36","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)"},{"key":"2020_CR37","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms Theory and Analysis.","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms Theory and Analysis. Wiley, Chichester (1997)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02020-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02020-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02020-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T19:26:54Z","timestamp":1709062014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02020-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["2020"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02020-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,6,13]]},"assertion":[{"value":"23 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2023","order":3,"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 no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}