{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T17:53:46Z","timestamp":1780336426574,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2079"],"award-info":[{"award-number":["N00014-18-1-2079"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-1835443"],"award-info":[{"award-number":["OAC-1835443"]}],"id":[{"id":"10.13039\/100000001","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":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The recent interior point algorithm by Dahl and Andersen [10] for nonsymmetric cones as well as earlier works [18, 21] require derivative information from the conjugate of the barrier function of the cones in the problem. Besides a few special cases, there is no indication of when this information is efficient to evaluate. We show how to compute the gradient of the conjugate barrier function for seven useful nonsymmetric cones. In some cases, this is helpful for deriving closed-form expressions for the inverse Hessian operator for the primal barrier.<\/jats:p>","DOI":"10.1007\/s10957-022-02076-1","type":"journal-article","created":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T10:02:40Z","timestamp":1660989760000},"page":"271-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing Conjugate Barrier Information for Nonsymmetric Cones"],"prefix":"10.1007","volume":"202","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1043-393X","authenticated-orcid":false,"given":"Lea","family":"Kapelevich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erling D.","family":"Andersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,20]]},"reference":[{"issue":"3","key":"2076_CR1","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. Optim. Methods Softw. 28(3), 396\u2013423 (2013). https:\/\/doi.org\/10.1080\/10556788.2012.684353","journal-title":"Optim. Methods Softw."},{"issue":"1\u20134","key":"2076_CR2","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. Optim. Methods Softw. 11(1\u20134), 613\u2013623 (1999). https:\/\/doi.org\/10.1080\/10556789908805765","journal-title":"Optim. Methods Softw."},{"key":"2076_CR3","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)"},{"key":"2076_CR4","unstructured":"Coey, C.: Interior point and outer approximation methods for conic optimization. Ph.D. thesis, Massachusetts Institute of Technology (2022)"},{"key":"2076_CR5","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Conic optimization with spectral functions on Euclidean Jordan algebras. arXiv preprint arXiv:2103.04104 (2021). https:\/\/doi.org\/10.48550","DOI":"10.1287\/moor.2022.1324"},{"key":"2076_CR6","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Hypatia cones reference (2021). https:\/\/github.com\/chriscoey\/Hypatia.jl\/wiki\/. Accessed 26 June 2022"},{"key":"2076_CR7","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Performance enhancements for a generic conic interior point algorithm. arXiv preprint arXiv:2107.04262 (2021)","DOI":"10.1007\/s12532-022-00226-0"},{"key":"2076_CR8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1202","author":"C Coey","year":"2022","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Solving natural conic formulations with Hypatia.jl. INFORMS J. Comput. (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1202","journal-title":"INFORMS J. Comput."},{"key":"2076_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45470-5_10","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"RM Corless","year":"2002","unstructured":"Corless, R.M., Jeffrey, D.J.: The wright $$\\omega $$ function. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds.) Artificial Intelligence, Automated Reasoning, and Symbolic Computation, pp. 76\u201389. Springer, Berlin (2002). https:\/\/doi.org\/10.1007\/3-540-45470-5_10"},{"issue":"1\u20132","key":"2076_CR10","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). https:\/\/doi.org\/10.1007\/s10107-021-01631-4","journal-title":"Math. Program."},{"issue":"4","key":"2076_CR11","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."},{"key":"2076_CR12","unstructured":"Julia Math: Doublefloats.jl. https:\/\/github.com\/JuliaMath\/DoubleFloats.jl. Accessed 28 May 2022"},{"issue":"1","key":"2076_CR13","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2(1), 173\u2013183 (1995)","journal-title":"J. Convex Anal."},{"key":"2076_CR14","unstructured":"MOSEK ApS: Modeling Cookbook Release 3.2.3 (2022). https:\/\/docs.mosek.com\/modeling-cookbook\/index.html. Accessed 3 July 2022"},{"key":"2076_CR15","unstructured":"Myklebust, T., Tun\u00e7el, L.: Interior-point algorithms for convex optimization based on primal-dual metrics. arXiv preprint arXiv:1411.2129 (2014). https:\/\/doi.org\/10.48550"},{"issue":"2","key":"2076_CR16","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(2), 261\u2013294 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0545-4","journal-title":"Math. Program."},{"key":"2076_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-1-4757-3216-0_17","volume-title":"High Performance Optimization","author":"Y Nesterov","year":"2000","unstructured":"Nesterov, Y.: Squared functional systems and optimization problems. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization, pp. 405\u2013440. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_17"},{"issue":"4\u20135","key":"2076_CR18","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. Optim. Methods Softw. 27(4\u20135), 893\u2013917 (2012). https:\/\/doi.org\/10.1080\/10556788.2011.567270","journal-title":"Optim. Methods Softw."},{"key":"2076_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization, Springer Optimization and Its Applications","author":"Y Nesterov","year":"2018","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"},{"key":"2076_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. Stud. Appl. Math: SIAM (1994). https:\/\/doi.org\/10.1137\/1.9781611970791","journal-title":"Stud. Appl. Math: SIAM"},{"issue":"2","key":"2076_CR21","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). https:\/\/doi.org\/10.1007\/s10107980009a","journal-title":"Math. Program."},{"issue":"1","key":"2076_CR22","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). https:\/\/doi.org\/10.1287\/moor.22.1.1","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2076_CR23","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/moor.22.1.1","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.1287\/moor.22.1.1","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2076_CR24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1287\/ijoc.2021.1058","volume":"34","author":"D Papp","year":"2022","unstructured":"Papp, D., Y\u0131ld\u0131z, S.: alfonso: Matlab package for nonsymmetric conic optimization. INFORMS J. Comput. 34(1), 11\u201319 (2022). https:\/\/doi.org\/10.1287\/ijoc.2021.1058","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2076_CR25","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. Optim. Lett. 16(2), 681\u2013694 (2022). https:\/\/doi.org\/10.1007\/s11590-021-01748-7","journal-title":"Optim. Lett."},{"key":"2076_CR26","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":"2076_CR27","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."},{"key":"2076_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801181","volume-title":"An Introduction to Numerical Analysis","author":"E S\u00fcli","year":"2003","unstructured":"S\u00fcli, E., Mayers, D.F.: An Introduction to Numerical Analysis. Cambridge University Press, Cambridge (2003)"},{"issue":"3","key":"2076_CR29","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":"2076_CR30","unstructured":"Vandenberghe, L.: The CVXOPT linear and quadratic cone program solvers (2010). https:\/\/www.seas.ucla.edu\/~vandenbe\/publications\/coneprog.pdf. Accessed 28 May 2022"},{"issue":"4","key":"2076_CR31","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). Optim. Methods Softw. 18(4), 491\u2013505 (2003). https:\/\/doi.org\/10.1080\/1055678031000118482","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02076-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:03:02Z","timestamp":1721548982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02076-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2076"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02076-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,20]]},"assertion":[{"value":"11 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}