{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T22:37:37Z","timestamp":1783031857353,"version":"3.54.6"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100014748","name":"Clarendon Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100014748","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We present an implementation of interior-point methods for generalized power cones, power mean cones and relative entropy cones, by exploiting underlying low-rank and sparsity properties of the Hessians of their logarithmically homogeneous self-concordant barrier functions. We prove that the augmented linear system in our interior-point method can be sparse and quasidefinite after adding a static regularization term, enabling the use of sparse LDL factorization for nonsymmetric cones. Numerical results show that our implementation can exploit sparsity in our test examples.<\/jats:p>","DOI":"10.1007\/s10957-024-02573-5","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T11:46:40Z","timestamp":1737546400000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Implementation of Interior-Point Methods for a Class of Nonsymmetric Cones"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3129-7698","authenticated-orcid":false,"given":"Yuwen","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Goulart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"3","key":"2573_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s12532-010-0016-2","volume":"2","author":"MS Andersen","year":"2010","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. Math. Progr. Comput. 2(3), 167\u2013201 (2010). https:\/\/doi.org\/10.1007\/s12532-010-0016-2","journal-title":"Math. Progr. Comput."},{"key":"2573_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"2573_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., El\u00a0Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. Society for Industrial and Applied Mathematics, Philadelphia (1994). https:\/\/doi.org\/10.1137\/1.9781611970777","DOI":"10.1137\/1.9781611970777"},{"issue":"1","key":"2573_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-0998-2","volume":"161","author":"V Chandrasekaran","year":"2017","unstructured":"Chandrasekaran, V., Shah, P.: Relative entropy optimization and its applications. Math. Program. 161(1), 1\u201332 (2017). https:\/\/doi.org\/10.1007\/s10107-016-0998-2","journal-title":"Math. Program."},{"key":"2573_CR5","unstructured":"Chares, P.R.: Cones and interior-point algorithms for structured convex optimization involving powers and exponentials. PhD thesis, Universit\u00e9 catholique de Louvain (2009)"},{"issue":"5","key":"2573_CR6","doi-asserted-by":"publisher","first-page":"2686","DOI":"10.1287\/ijoc.2022.1202","volume":"34","author":"C Coey","year":"2022","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Solving natural conic formulations with Hypatia.jl. INFORMS J. Comput. 34(5), 2686\u20132699 (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1202","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2573_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s12532-022-00226-0","volume":"15","author":"C Coey","year":"2023","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Performance enhancements for a generic conic interior point algorithm. Math. Program. Comput. 15(1), 53\u2013101 (2023). https:\/\/doi.org\/10.1007\/s12532-022-00226-0","journal-title":"Math. Program. Comput."},{"key":"2573_CR8","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Pe\u00f1a, J., T\u00fct\u00fcnc\u00fc, R.: Optimization Methods in Finance, 2nd edn. Cambridge University Press, Cambridge (2018). https:\/\/doi.org\/10.1017\/9781107297340","DOI":"10.1017\/9781107297340"},{"key":"2573_CR9","unstructured":"Cuturi, M., Doucet, A.: Fast computation of Wasserstein barycenters. In: Xing, E.P., Jebara, T. (eds.) Proceedings of the 31st International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 32, pp. 685\u2013693. PMLR, Bejing, China (2014)"},{"key":"2573_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01631-4","author":"J Dahl","year":"2021","unstructured":"Dahl, J., Andersen, E.D.: A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01631-4","journal-title":"Math. Program."},{"issue":"4","key":"2573_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/1114268.1114277","volume":"31","author":"TA Davis","year":"2005","unstructured":"Davis, T.A.: Algorithm 849: a concise sparse cholesky factorization package. ACM Trans. Math. Softw. 31(4), 587\u2013591 (2005). https:\/\/doi.org\/10.1145\/1114268.1114277","journal-title":"ACM Trans. Math. Softw."},{"key":"2573_CR12","doi-asserted-by":"crossref","unstructured":"Domahidi, A., Chu, E., Boyd, S.: ECOS: an SOCP solver for embedded systems. In: 2013 European Control Conference (ECC), pp. 3071\u20133076. IEEE, Zurich (2013). https:\/\/doi.org\/10.23919\/ECC.2013.6669541","DOI":"10.23919\/ECC.2013.6669541"},{"issue":"3","key":"2573_CR13","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s10957-021-01896-x","volume":"190","author":"M Garstka","year":"2021","unstructured":"Garstka, M., Cannon, M., Goulart, P.: COSMO: a conic operator splitting method for convex conic problems. J. Optim. Theory Appl. 190(3), 779\u2013810 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"2573_CR14","unstructured":"Goulart, P.J., Chen, Y.: Clarabel: an interior-point solver for conic programs with quadratic objectives. arXiv. arXiv:2405.12762 (2024)"},{"key":"2573_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-022-02076-1","author":"L Kapelevich","year":"2022","unstructured":"Kapelevich, L., Andersen, E.D., Vielma, J.P.: Computing conjugate barrier information for nonsymmetric cones. J. Optim. Theory Appl. (2022). https:\/\/doi.org\/10.1007\/s10957-022-02076-1","journal-title":"J. Optim. Theory Appl."},{"key":"2573_CR16","doi-asserted-by":"crossref","unstructured":"Karimi, M., Tun\u00e7el, L.: Domain-driven solver (DDS) version 2.1: A MATLAB-based software package for convex optimization problems in domain-driven form. Math. Programm. Comput. (2023). https:\/\/doi.org\/10.1007\/s12532-023-00248-2","DOI":"10.1007\/s12532-023-00248-2"},{"issue":"8","key":"2573_CR17","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1109\/JSAC.2006.879347","volume":"24","author":"Z-Q Luo","year":"2006","unstructured":"Luo, Z.-Q., Yu, W.: An introduction to convex optimization for communications and signal processing. IEEE J. Sel. Areas Commun. 24(8), 1426\u20131438 (2006). https:\/\/doi.org\/10.1109\/JSAC.2006.879347","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"2573_CR18","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). https:\/\/doi.org\/10.1137\/0802028","journal-title":"SIAM J. Optim."},{"key":"2573_CR19","unstructured":"MOSEK APS.: MOSEK Modeling Cookbook. (2023). https:\/\/docs.mosek.com\/MOSEKModelingCookbook-a4paper.pdf"},{"issue":"2","key":"2573_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s12532-020-00193-4","volume":"13","author":"R Murray","year":"2021","unstructured":"Murray, R., Chandrasekaran, V., Wierman, A.: Signomial and polynomial optimization via relative entropy and partial dualization. Math. Program. Comput. 13(2), 257\u2013295 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00193-4","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2573_CR21","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."},{"issue":"2","key":"2573_CR22","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(2), 324\u2013364 (1998). https:\/\/doi.org\/10.1137\/S1052623495290209","journal-title":"SIAM J. Optim."},{"issue":"4\u20135","key":"2573_CR23","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1080\/10556788.2011.567270","volume":"27","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Towards non-symmetric conic optimization. Opt. Methods Softw. 27(4\u20135), 893\u2013917 (2012). https:\/\/doi.org\/10.1080\/10556788.2011.567270","journal-title":"Opt. Methods Softw."},{"key":"2573_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY (2006)"},{"issue":"3","key":"2573_CR25","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0892-3","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2573_CR26","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1137\/17M1160124","volume":"29","author":"D Papp","year":"2019","unstructured":"Papp, D., Yildiz, S.: Sum-of-squares optimization without semidefinite programming. SIAM J. Optim. 29(1), 822\u2013851 (2019). https:\/\/doi.org\/10.1137\/17M1160124","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2573_CR27","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11590-021-01748-7","volume":"16","author":"S Roy","year":"2022","unstructured":"Roy, S., Xiao, L.: On self-concordant barriers for generalized power cones. Opt. Lett. 16(2), 681\u2013694 (2022). https:\/\/doi.org\/10.1007\/s11590-021-01748-7","journal-title":"Opt. Lett."},{"key":"2573_CR28","unstructured":"Serrano, S.A.: Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone. PhD thesis, Stanford University (2015)"},{"issue":"2","key":"2573_CR29","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0773-1","volume":"150","author":"A Skajaa","year":"2015","unstructured":"Skajaa, A., Ye, Y.: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Program. 150(2), 391\u2013422 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0773-1","journal-title":"Math. Program."},{"issue":"2","key":"2573_CR30","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/S1064827595286578","volume":"19","author":"T Terlaky","year":"1998","unstructured":"Terlaky, T., Vial, J.P.: Computing maximum likelihood estimators of convex density functions. SIAM J. Sci. Comput. 19(2), 675\u2013694 (1998). https:\/\/doi.org\/10.1137\/S1064827595286578","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2573_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002080010009","volume":"1","author":"L Tun\u00e7el","year":"2001","unstructured":"Tun\u00e7el, L.: Generalization of primal-dual interior-point methods to convex optimization problems in conic form. Found. Comput. Math. 1(3), 229\u2013254 (2001). https:\/\/doi.org\/10.1007\/s002080010009","journal-title":"Found. Comput. Math."},{"key":"2573_CR32","unstructured":"Vandenberghe, L.: The CVXOPT Linear and Quadratic Cone Program Solvers. (2010)"},{"issue":"1","key":"2573_CR33","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1995","unstructured":"Vanderbei, R.J.: Symmetric quasidefinite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995). https:\/\/doi.org\/10.1137\/0805005","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2573_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $$\\text{ O }(\\sqrt{nL})$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994). https:\/\/doi.org\/10.1287\/moor.19.1.53","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02573-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02573-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02573-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T12:54:03Z","timestamp":1739364843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02573-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2573"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02573-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"14 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"33"}}