{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T06:54:35Z","timestamp":1777013675803,"version":"3.51.4"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006919","name":"Massachusetts Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006919","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recent work, we provide computational arguments for expanding the class of proper cones recognized by conic optimization solvers, to permit simpler, smaller, more natural conic formulations. We define an exotic cone as a proper cone for which we can implement a small set of tractable (i.e. fast, numerically stable, analytic) oracles for a logarithmically homogeneous self-concordant barrier for the cone or for its dual cone. Our extensible, open-source conic interior point solver, Hypatia, allows modeling and solving any conic problem over a Cartesian product of exotic cones. In this paper, we introduce Hypatia\u2019s interior point algorithm, which generalizes that of Skajaa and Ye (Math. Program. 150(2):391\u2013422, 2015) by handling exotic cones without tractable primal oracles. To improve iteration count and solve time in practice, we propose four enhancements to the interior point stepping procedure of Skajaa and Ye: (1) loosening the central path proximity conditions, (2) adjusting the directions using a third order directional derivative barrier oracle, (3) performing a backtracking search on a curve, and (4) combining the prediction and centering directions. We implement 23 useful exotic cones in Hypatia. We summarize the complexity of computing oracles for these cones and show that our new third order oracle is not a bottleneck. From 37 applied examples, we generate a diverse benchmark set of 379 problems. Our computational testing shows that each stepping enhancement improves Hypatia\u2019s iteration count and solve time. Altogether, the enhancements reduce the geometric means of iteration count and solve time by over 80% and 70% respectively.<\/jats:p>","DOI":"10.1007\/s12532-022-00226-0","type":"journal-article","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T15:02:42Z","timestamp":1663426962000},"page":"53-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Performance enhancements for a generic conic interior point algorithm"],"prefix":"10.1007","volume":"15","author":[{"given":"Chris","family":"Coey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lea","family":"Kapelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"issue":"5","key":"226_CR1","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11590-019-01422-z","volume":"13","author":"A Agrawal","year":"2019","unstructured":"Agrawal, A., Diamond, S., Boyd, S.: Disciplined geometric programming. Optimization Letters 13(5), 961\u2013976 (2019)","journal-title":"Optimization Letters"},{"issue":"2","key":"226_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"ED Andersen","year":"2003","unstructured":"Andersen, E.D., Roos, C., Terlaky, T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95(2), 249\u2013277 (2003)","journal-title":"Math. Program."},{"key":"226_CR3","volume-title":"Optimization for Machine Learning","author":"M Andersen","year":"2011","unstructured":"Andersen, M., Dahl, J., Liu, Z., Vandenberghe, L., Sra, S., Nowozin, S., Wright, S.: Interior-point methods for large-scale cone programming. In: Sra, S., Wright, S.J., Nowozin, S. (eds.) Optimization for Machine Learning, vol. 5583. MIT Press Cambridge, MA (2011)"},{"issue":"3","key":"226_CR4","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1080\/10556788.2012.684353","volume":"28","author":"MS Andersen","year":"2013","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: Logarithmic barriers for sparse matrix cones. Optimization Methods and Software 28(3), 396\u2013423 (2013)","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"226_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-003-0470-y","volume":"100","author":"V Anh Truong","year":"2004","unstructured":"Anh Truong, V., Tun\u00e7el, L.: Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. Math. Program. 100(2), 295\u2013316 (2004)","journal-title":"Math. Program."},{"issue":"8","key":"226_CR6","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1016\/j.automatica.2007.12.012","volume":"44","author":"EM Aylward","year":"2008","unstructured":"Aylward, E.M., Parrilo, P.A., Slotine, J.J.E.: Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming. Automatica 44(8), 2163\u20132170 (2008)","journal-title":"Automatica"},{"issue":"1","key":"226_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: A fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"issue":"1\u20134","key":"226_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, a C library for semidefinite programming. Optimization Methods and Software 11(1\u20134), 613\u2013623 (1999)","journal-title":"Optimization Methods and Software"},{"key":"226_CR9","unstructured":"Boyd, S.: EE363 review session 4: Linear matrix inequalities. University Lecture (2009). https:\/\/stanford.edu\/class\/ee363\/sessions\/s4notes.pdf. Online, accessed 30-July-2022"},{"key":"226_CR10","doi-asserted-by":"crossref","unstructured":"Boyd, S., El\u00a0Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. Studies in Applied and Numerical Mathematics, vol.\u00a015. SIAM (1994)","DOI":"10.1137\/1.9781611970777"},{"key":"226_CR11","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"1","key":"226_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/S105262340240851X","volume":"14","author":"S Burer","year":"2003","unstructured":"Burer, S.: Semidefinite programming in the space of partial positive semidefinite matrices. SIAM J. Optim. 14(1), 139\u2013172 (2003)","journal-title":"SIAM J. Optim."},{"key":"226_CR13","unstructured":"Burkardt, J.: Polynomials for global optimization tests (2016). https:\/\/people.sc.fsu.edu\/~jburkardt\/py_src\/polynomials\/polynomials.html. Online, accessed 30-July-2022"},{"issue":"2","key":"226_CR14","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1137\/140988978","volume":"26","author":"V Chandrasekaran","year":"2016","unstructured":"Chandrasekaran, V., Shah, P.: Relative entropy relaxations for signomial optimization. SIAM J. Optim. 26(2), 1147\u20131173 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"226_CR15","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\u20132), 1\u201332 (2017)","journal-title":"Math. Program."},{"key":"226_CR16","unstructured":"Chares, R.: Cones and interior-point algorithms for structured convex optimization involving powers and exponentials. Ph.D. thesis, Universit\u00e9 Catholique de Louvain (2009)"},{"issue":"3","key":"226_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391989.1391995","volume":"35","author":"Y Chen","year":"2008","unstructured":"Chen, Y., Davis, T.A., Hager, W.W., Rajamanickam, S.: Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update\/downdate. ACM Transactions on Mathematical Software (TOMS) 35(3), 1\u201314 (2008)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"226_CR18","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Conic optimization with spectral functions on Euclidean Jordan algebras. arXiv:2103.04104 (2021)","DOI":"10.1287\/moor.2022.1324"},{"key":"226_CR19","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Hypatia documentation (2022). https:\/\/chriscoey.github.io\/Hypatia.jl\/dev\/. Online, accessed 30-July-2022"},{"key":"226_CR20","doi-asserted-by":"publisher","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Solving natural conic formulations with Hypatia. jl. INFORMS Journal on Computing (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1202","DOI":"10.1287\/ijoc.2022.1202"},{"issue":"1\u20132","key":"226_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10107-021-01631-4","volume":"194","author":"J Dahl","year":"2022","unstructured":"Dahl, J., Andersen, E.D.: A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization. Math. Program. 194(1\u20132), 341\u2013370 (2022)","journal-title":"Math. Program."},{"issue":"3","key":"226_CR22","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"issue":"2","key":"226_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"226_CR24","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 (2013)","DOI":"10.23919\/ECC.2013.6669541"},{"issue":"2","key":"226_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"15","key":"226_CR26","doi-asserted-by":"publisher","first-page":"154003","DOI":"10.1088\/1751-8121\/aab285","volume":"51","author":"H Fawzi","year":"2018","unstructured":"Fawzi, H., Fawzi, O.: Efficient optimization of the quantum relative entropy. J. Phys. A: Math. Theor. 51(15), 154003 (2018)","journal-title":"J. Phys. A: Math. Theor."},{"key":"226_CR27","doi-asserted-by":"crossref","unstructured":"Fawzi, H., Saunderson, J.: Optimal self-concordant barriers for quantum relative entropies. arXiv:2205.04581 (2022)","DOI":"10.1137\/22M1500216"},{"issue":"2","key":"226_CR28","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10208-018-9385-0","volume":"19","author":"H Fawzi","year":"2019","unstructured":"Fawzi, H., Saunderson, J., Parrilo, P.A.: Semidefinite approximations of the matrix logarithm. Found. Comput. Math. 19(2), 259\u2013296 (2019)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"226_CR29","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"PJ Fleming","year":"1986","unstructured":"Fleming, P.J., Wallace, J.J.: How not to lie with statistics: the correct way to summarize benchmark results. Commun. ACM 29(3), 218\u2013221 (1986)","journal-title":"Commun. ACM"},{"issue":"2","key":"226_CR30","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s12532-015-0092-4","volume":"8","author":"HA Friberg","year":"2016","unstructured":"Friberg, H.A.: CBLIB 2014: A benchmark library for conic mixed-integer and continuous optimization. Math. Program. Comput. 8(2), 191\u2013214 (2016)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"226_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Transactions on Mathematical Software (TOMS) 43(2), 1\u20135 (2016)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"issue":"4","key":"226_CR32","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O G\u00fcler","year":"1996","unstructured":"G\u00fcler, O.: Barrier functions in interior point methods. Math. Oper. Res. 21(4), 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"226_CR33","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01584844","volume":"81","author":"O G\u00fcler","year":"1998","unstructured":"G\u00fcler, O., Tun\u00e7el, L.: Characterization of the barrier parameter of homogeneous convex cones. Math. Program. 81(1), 55\u201376 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"226_CR34","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TAC.2013.2283095","volume":"59","author":"D Henrion","year":"2013","unstructured":"Henrion, D., Korda, M.: Convex computation of the region of attraction of polynomial control systems. IEEE Trans. Autom. Control 59(2), 297\u2013312 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"226_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01831-6","author":"L Kapelevich","year":"2022","unstructured":"Kapelevich, L., Coey, C., Vielma, J.P.: Sum of squares generalizations for conic sets. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01831-6","journal-title":"Math. Program."},{"key":"226_CR36","unstructured":"Karimi, M., Tun\u00e7el, L.: Domain-Driven Solver (DDS) version 2.0: a MATLAB-based software package for convex optimization problems in domain-driven form. arXiv:1908.03075 (2020)"},{"issue":"2","key":"226_CR37","first-page":"591","volume":"45","author":"M Karimi","year":"2020","unstructured":"Karimi, M., Tun\u00e7el, L.: Primal-dual interior-point methods for domain-driven formulations. Math. Oper. Res. 45(2), 591\u2013621 (2020)","journal-title":"Math. Oper. Res."},{"key":"226_CR38","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.automatica.2016.01.022","volume":"67","author":"M Korda","year":"2016","unstructured":"Korda, M., Henrion, D., Jones, C.N.: Controller design and value function approximation for nonlinear dynamical systems. Automatica 67, 54\u201366 (2016)","journal-title":"Automatica"},{"issue":"4","key":"226_CR39","doi-asserted-by":"publisher","first-page":"2461","DOI":"10.1137\/14097865X","volume":"25","author":"M Laurent","year":"2015","unstructured":"Laurent, M., Piovesan, T.: Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone. SIAM J. Optim. 25(4), 2461\u20132493 (2015)","journal-title":"SIAM J. Optim."},{"issue":"525","key":"226_CR40","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1080\/01621459.2017.1407771","volume":"114","author":"R Mazumder","year":"2019","unstructured":"Mazumder, R., Choudhury, A., Iyengar, G., Sen, B.: A computational framework for multivariate convex regression and its variants. J. Am. Stat. Assoc. 114(525), 318\u2013331 (2019)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"226_CR41","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":"226_CR42","unstructured":"MOSEK ApS: Modeling Cookbook Release 3.3.0 (2022). https:\/\/docs.mosek.com\/modeling-cookbook\/index.html. Online, accessed 30-July-2022"},{"key":"226_CR43","unstructured":"MOSEK ApS: MOSEK Optimizer API for Java 9.3.20 (2022). https:\/\/docs.mosek.com\/latest\/javaapi\/index.html. Online, accessed 30-July-2022"},{"key":"226_CR44","unstructured":"M.S. Andersen and J. Dahl and L. Vandenberghe: CVXOPT User\u2019s Guide - Cone Programming - Algorithm Parameters (2021). https:\/\/cvxopt.org\/userguide\/coneprog.html#algorithm-parameters. Online, accessed 30-July-2022"},{"key":"226_CR45","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, 257\u2013295 (2021)","journal-title":"Math. Program. Comput."},{"key":"226_CR46","unstructured":"Myklebust, T., Tun\u00e7el, L.: Interior-point algorithms for convex optimization based on primal-dual metrics. arXiv:1411.2129 (2014)"},{"issue":"4\u20135","key":"226_CR47","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. Optimization Methods and Software 27(4\u20135), 893\u2013917 (2012)","journal-title":"Optimization Methods and Software"},{"key":"226_CR48","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer Optimization and Its Applications, vol. 137. Springer Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91578-4","DOI":"10.1007\/978-3-319-91578-4"},{"key":"226_CR49","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"2","key":"226_CR50","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10107980009a","volume":"84","author":"Y Nesterov","year":"1999","unstructured":"Nesterov, Y., Todd, M.J., Ye, Y.: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84(2), 227\u2013267 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"226_CR51","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":"226_CR52","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)","journal-title":"SIAM J. Optim."},{"key":"226_CR53","doi-asserted-by":"publisher","unstructured":"Orban, D.: BenchmarkProfiles.jl (2019). https:\/\/doi.org\/10.5281\/zenodo.4630955","DOI":"10.5281\/zenodo.4630955"},{"issue":"3","key":"226_CR54","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)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"226_CR55","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1080\/10618600.2012.707343","volume":"23","author":"D Papp","year":"2014","unstructured":"Papp, D., Alizadeh, F.: Shape-constrained estimation using nonnegative splines. J. Comput. Graph. Stat. 23(1), 211\u2013231 (2014)","journal-title":"J. Comput. Graph. Stat."},{"key":"226_CR56","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: On \u201ca homogeneous interior-point algorithm for non-symmetric convex conic optimization\u201d. arxiv:1712.00492 (2018)"},{"issue":"1","key":"226_CR57","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1137\/17M1160124","volume":"29","author":"D Papp","year":"2019","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: Sum-of-squares optimization without semidefinite programming. SIAM J. Optim. 29(1), 822\u2013851 (2019)","journal-title":"SIAM J. Optim."},{"key":"226_CR58","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: alfonso: ALgorithm FOr Non-Symmetric Optimization (2020). https:\/\/github.com\/dpapp-github\/alfonso"},{"issue":"1","key":"226_CR59","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1287\/ijoc.2021.1058","volume":"34","author":"D Papp","year":"2021","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: Alfonso: Matlab package for nonsymmetric conic optimization. INFORMS J. Comput. 34(1), 11\u201319 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"226_CR60","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/15M1049415","volume":"27","author":"F Permenter","year":"2017","unstructured":"Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. SIAM J. Optim. 27(3), 1257\u20131282 (2017)","journal-title":"SIAM J. Optim."},{"key":"226_CR61","doi-asserted-by":"crossref","unstructured":"Renegar, J.: A mathematical view of interior-point methods in convex optimization. MOS-SIAM Series on Optimization. SIAM (2001)","DOI":"10.1137\/1.9780898718812"},{"issue":"2","key":"226_CR62","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. Optimization Letters 16(2), 681\u2013694 (2022)","journal-title":"Optimization Letters"},{"key":"226_CR63","unstructured":"Serrano, S.A.: Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone. Ph.D. thesis, Stanford University (2015)"},{"issue":"2","key":"226_CR64","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)","journal-title":"Math. Program."},{"issue":"4","key":"226_CR65","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1137\/15M1011020","volume":"36","author":"Y Sun","year":"2015","unstructured":"Sun, Y., Vandenberghe, L.: Decomposition methods for sparse matrix nearness problems. SIAM J. Matrix Anal. Appl. 36(4), 1691\u20131717 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"226_CR66","unstructured":"Vandenberghe, L.: The CVXOPT linear and quadratic cone program solvers (2010). https:\/\/www.seas.ucla.edu\/~vandenbe\/publications\/coneprog.pdf. Online, accessed 30-July-2022"},{"issue":"1","key":"226_CR67","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X Xu","year":"1996","unstructured":"Xu, X., Hung, P.F., Ye, Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62(1), 151\u2013171 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"226_CR68","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1080\/1055678031000118482","volume":"18","author":"M Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0). Optimization Methods and Software 18(4), 491\u2013505 (2003)","journal-title":"Optimization Methods and Software"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00226-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-022-00226-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00226-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T03:50:21Z","timestamp":1701057021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-022-00226-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,17]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s12532-022-00226-0","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,17]]},"assertion":[{"value":"8 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}