{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:43:53Z","timestamp":1781887433364,"version":"3.54.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s12532-023-00248-2","type":"journal-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T13:01:46Z","timestamp":1697893306000},"page":"37-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form"],"prefix":"10.1007","volume":"16","author":[{"given":"Mehdi","family":"Karimi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"248_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.aim.2018.03.038","volume":"334","author":"N Amini","year":"2018","unstructured":"Amini, N., Br\u00e4nd\u00e9n, P.: Non-representable hyperbolic matroids. Adv. Math. 334, 417\u2013449 (2018)","journal-title":"Adv. Math."},{"issue":"1","key":"248_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Kim, S.J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8(1), 67\u2013127 (2007)","journal-title":"Optim. Eng."},{"issue":"1","key":"248_CR3","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.aim.2007.05.011","volume":"216","author":"P Br\u00e4nd\u00e9n","year":"2007","unstructured":"Br\u00e4nd\u00e9n, P.: Polynomials with the half-plane property and matroid theory. Adv. Math. 216(1), 302\u2013320 (2007)","journal-title":"Adv. Math."},{"issue":"2","key":"248_CR4","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.aim.2010.08.003","volume":"226","author":"P Br\u00e4nd\u00e9n","year":"2011","unstructured":"Br\u00e4nd\u00e9n, P.: Obstructions to determinantal representability. Adv. Math. 226(2), 1202\u20131212 (2011)","journal-title":"Adv. Math."},{"issue":"5","key":"248_CR5","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1007\/s11590-013-0694-6","volume":"8","author":"P Br\u00e4nd\u00e9n","year":"2014","unstructured":"Br\u00e4nd\u00e9n, P.: Hyperbolicity cones of elementary symmetric polynomials are spectrahedral. Opt. Lett. 8(5), 1773\u20131782 (2014)","journal-title":"Opt. Lett."},{"key":"248_CR6","unstructured":"Burton, S., Vinzant, C., Youm, Y.: A real stable extension of the Vamos matroid polynomial. arXiv preprint arXiv:1411.2038 (2014)"},{"issue":"1\u20132","key":"248_CR7","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":"248_CR8","unstructured":"Chares, R.: Cones and interior-point algorithms for structured convex optimization involving powers and exponentials. Ph.D. thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve (2008)"},{"issue":"1\u20132","key":"248_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0196-8858(03)00078-2","volume":"32","author":"YB Choe","year":"2004","unstructured":"Choe, Y.B., Oxley, J.G., Sokal, A.D., Wagner, D.G.: Homogeneous multivariate polynomials with the half-plane property. Adv. Appl. Math. 32(1\u20132), 88\u2013187 (2004)","journal-title":"Adv. Appl. Math."},{"key":"248_CR10","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Performance enhancements for a generic conic interior point algorithm. Mathematical Programming Computation pp. 1\u201349 (2022)","DOI":"10.1007\/s12532-022-00226-0"},{"issue":"5","key":"248_CR11","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)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20132","key":"248_CR12","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":"4","key":"248_CR13","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/BF01898787","volume":"8","author":"C Davis","year":"1957","unstructured":"Davis, C.: All convex invariant functions of Hermitian matrices. Arch. Math. 8(4), 276\u2013278 (1957)","journal-title":"Arch. Math."},{"issue":"2","key":"248_CR14","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). https:\/\/doi.org\/10.1137\/15M1020575","journal-title":"SIAM Rev."},{"key":"248_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6131-6","volume-title":"Entropy optimization and mathematical programming","author":"SC Fang","year":"1997","unstructured":"Fang, S.C., Rajasekera, J.R., Tsao, H.S.J.: Entropy optimization and mathematical programming, vol. 8. Springer, Berln (1997)"},{"key":"248_CR16","doi-asserted-by":"crossref","unstructured":"Fawzi, H., Saunderson, J.: Optimal self-concordant barriers for quantum relative entropies. arXiv preprint arXiv:2205.04581 (2022)","DOI":"10.1137\/22M1500216"},{"issue":"2","key":"248_CR17","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."},{"key":"248_CR18","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1007\/s11590-017-1145-6","volume":"11","author":"L Faybusovich","year":"2017","unstructured":"Faybusovich, L., Tsuchiya, T.: Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems. Opt. Lett. 11, 1513\u20131526 (2017)","journal-title":"Opt. Lett."},{"key":"248_CR19","unstructured":"Faybusovich, L., Zhou, C.: Long-step path-following algorithm in quantum information theory: Some numerical aspects and applications. arXiv preprint arXiv:1906.00037 (2020)"},{"issue":"2","key":"248_CR20","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."},{"key":"248_CR21","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.2. (2020) http:\/\/cvxr.com\/cvx"},{"issue":"2","key":"248_CR22","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1287\/moor.22.2.350","volume":"22","author":"O G\u00fcler","year":"1997","unstructured":"G\u00fcler, O.: Hyperbolic polynomials and interior point methods for convex programming. Math. Oper. Res. 22(2), 350\u2013377 (1997)","journal-title":"Math. Oper. Res."},{"key":"248_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04150-6","volume-title":"Introduction to matrix analysis and applications","author":"F Hiai","year":"2014","unstructured":"Hiai, F., Petz, D.: Introduction to matrix analysis and applications. Springer, Berlin (2014)"},{"key":"248_CR24","doi-asserted-by":"publisher","unstructured":"Karimi, M., Tun\u00e7el, L.: mehdi-karimi-math\/DDS: DDS 2.1 (2023). https:\/\/doi.org\/10.5281\/zenodo.8339473","DOI":"10.5281\/zenodo.8339473"},{"issue":"2","key":"248_CR25","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."},{"issue":"1\u20132","key":"248_CR26","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s10107-021-01663-w","volume":"194","author":"M Karimi","year":"2022","unstructured":"Karimi, M., Tun\u00e7el, L.: Status determination by interior-point methods for convex optimization problems in Domain-Driven form. Math. Program. 194(1\u20132), 937\u2013974 (2022)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"248_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-003-0441-3","volume":"97","author":"AS Lewis","year":"2003","unstructured":"Lewis, A.S.: The mathematics of eigenvalue optimization. Math. Program. 97(1\u20132), 155\u2013176 (2003)","journal-title":"Math. Program."},{"key":"248_CR28","unstructured":"MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 9.0. (2019). http:\/\/docs.mosek.com\/9.0\/toolbox\/index.html"},{"key":"248_CR29","unstructured":"Myklebust, T.G.J.: On primal-dual interior-point algorithms for convex optimisation. Ph.D. thesis, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo (2015)"},{"key":"248_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10107-004-0545-4","volume":"102","author":"A Nemirovski","year":"2005","unstructured":"Nemirovski, A., Tun\u00e7el, L.: Cone-free primal-dual path-following and potential reduction polynomial time interior-point methods. Math. Program. 102, 261\u2013294 (2005)","journal-title":"Math. Program."},{"key":"248_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on convex optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on convex optimization. Springer, Berlin (2018)"},{"key":"248_CR32","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM Series in Applied Mathematics, SIAM, Philadelphia (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"1","key":"248_CR33","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)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"248_CR34","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."},{"key":"248_CR35","unstructured":"Pataki, G., Schmieta, S.: The DIMACS library of semidefinite-quadratic-linear programs. Preliminary draft, Computational Optimization Research Center, Columbia University, New York, Tech. Rep. (2002)"},{"issue":"3","key":"248_CR36","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"1","key":"248_CR37","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10208-004-0136-z","volume":"6","author":"J Renegar","year":"2006","unstructured":"Renegar, J.: Hyperbolic programs, and their derivative relaxations. Found. Comput. Math. 6(1), 59\u201379 (2006)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"248_CR38","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)","journal-title":"Opt. Lett."},{"issue":"2","key":"248_CR39","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."},{"key":"248_CR40","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2013 a MATLAB software package for semidefinite programming, version 1.3. Opt. Methods Softw., 11(1-4), 545\u2013581 (1999)","DOI":"10.1080\/10556789908805762"},{"key":"248_CR41","doi-asserted-by":"crossref","unstructured":"Tropp, J.A.: An introduction to matrix concentration inequalities. Foundations and Trends\u00ae in Machine Learning 8(1-2), 1\u2013230 (2015)","DOI":"10.1561\/2200000048"},{"issue":"3","key":"248_CR42","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)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"248_CR43","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10208-010-9069-x","volume":"10","author":"L Tun\u00e7el","year":"2010","unstructured":"Tun\u00e7el, L., Nemirovski, A.: Self-concordant barriers for convex approximations of structured convex sets. Found. Comput. Math. 10(5), 485\u2013525 (2010)","journal-title":"Found. Comput. Math."},{"issue":"6","key":"248_CR44","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.disc.2008.02.005","volume":"309","author":"DG Wagner","year":"2009","unstructured":"Wagner, D.G., Wei, Y.: A criterion for the half-plane property. Discret. Math. 309(6), 1385\u20131390 (2009)","journal-title":"Discret. Math."},{"key":"248_CR45","unstructured":"Wang, W., L\u00fctkenhaus, N.: OpenQKDSecurity platform. (2021) https:\/\/github.com\/nlutkenhaus\/openQKDsecurity"},{"key":"248_CR46","doi-asserted-by":"publisher","first-page":"77","DOI":"10.22331\/q-2018-07-26-77","volume":"2","author":"A Winick","year":"2018","unstructured":"Winick, A., L\u00fctkenhaus, N., Coles, P.J.: Reliable numerical key rates for quantum key distribution. Quantum 2, 77 (2018)","journal-title":"Quantum"},{"key":"248_CR47","doi-asserted-by":"crossref","unstructured":"Zinchenko, Y.: On hyperbolicity cones associated with elementary symmetric polynomials. Optim. Lett. 2(3), 389\u2013402 (2008)","DOI":"10.1007\/s11590-007-0067-0"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-023-00248-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-023-00248-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-023-00248-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T19:29:51Z","timestamp":1709062191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-023-00248-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1007\/s12532-023-00248-2","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"12 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}