{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:06:52Z","timestamp":1772759212207,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,12,15]],"date-time":"2018-12-15T00:00:00Z","timestamp":1544832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100002336","name":"Simmons Family Foundation","doi-asserted-by":"publisher","award":["275013"],"award-info":[{"award-number":["275013"]}],"id":[{"id":"10.13039\/100002336","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10589-018-0054-7","type":"journal-article","created":{"date-parts":[[2018,12,15]],"date-time":"2018-12-15T10:41:04Z","timestamp":1544870464000},"page":"769-795","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5540-6786","authenticated-orcid":false,"given":"Leonid","family":"Faybusovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cunlu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,15]]},"reference":[{"key":"54_CR1","unstructured":"ApS,\u00a0MOSEK: The MOSEK optimization toolbox for MATLAB manual, version 8.0 (Revision 60). http:\/\/docs.mosek.com\/8.0\/toolbox\/index.html (2017)"},{"key":"54_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, New York (1997)"},{"issue":"1\u20132","key":"54_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-0998-2","volume":"161","author":"V Chandrasecaran","year":"2017","unstructured":"Chandrasecaran, V., Shah, P.: Relative entropy optimization and its applications. Math. Program. Ser. A 161(1\u20132), 1\u201332 (2017)","journal-title":"Math. Program. Ser. A"},{"key":"54_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1134-8","volume-title":"Interior Point Approach to Linear. Quadratic and Convex Programming","author":"D Hertog den","year":"1994","unstructured":"den Hertog, D.: Interior Point Approach to Linear. Quadratic and Convex Programming. Springer, Dordrecht (1994)"},{"issue":"1","key":"54_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00940075","volume":"73","author":"D Hertog den","year":"1992","unstructured":"den Hertog, D., Roos, C., Terlaky, T.: On the classical logarithmic barrier function method for a class of smooth convex programming problems. J. Optim. Theory Appl. 73(1), 1\u201325 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"54_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Cambridge University Press, Cambridge (1994)"},{"key":"54_CR7","doi-asserted-by":"publisher","unstructured":"Fawzi, H., Saunderson, J., Parrilo, P.A.: Semidefinite approximations of the matrix logarithm. Comput. Math. Found. (2018). https:\/\/doi.org\/10.1007\/s10208-018-9385-0","DOI":"10.1007\/s10208-018-9385-0"},{"issue":"4","key":"54_CR8","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S1052623494270741","volume":"6","author":"L Faybusovich","year":"1996","unstructured":"Faybusovich, L.: Semidefinite programming: a path-following algorithm for a linear-quadratic functional. SIAM J. Optim. 6(4), 1007\u20131024 (1996)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"54_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1080\/02331930701523510","volume":"57","author":"L Faybusovich","year":"2008","unstructured":"Faybusovich, L.: Several Jordan-algebraic aspects of optimization. Optimization 57(3), 379\u2013393 (2008)","journal-title":"Optimization"},{"issue":"3","key":"54_CR10","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s10957-014-0577-8","volume":"164","author":"L Faybusovich","year":"2015","unstructured":"Faybusovich, L.: On Hazan\u2019s algorithm for symmetric programming problems. J. Optim. Theory Appl. 164(3), 915\u2013932 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.laa.2017.09.017","volume":"536","author":"L Faybusovich","year":"2018","unstructured":"Faybusovich, L.: Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions. Linear Algebra Appl. 536, 228\u2013249 (2018)","journal-title":"Linear Algebra Appl."},{"issue":"8","key":"54_CR12","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. Optim. Lett. 11(8), 1513\u20131526 (2017)","journal-title":"Optim. Lett."},{"key":"54_CR13","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2017)"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01455996","volume":"269","author":"A Kor\u00e1nyi","year":"1984","unstructured":"Kor\u00e1nyi, A.: Monotone functions on formally real Jordan algebras. Math. Ann. 269, 73\u201376 (1984)","journal-title":"Math. Ann."},{"key":"54_CR15","unstructured":"L\u00f6fberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB, In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"key":"54_CR16","unstructured":"MathWorks, Inc.: MATLAB R2016a. Natick, MA (2016)"},{"key":"54_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer, Boston (2004)"},{"key":"54_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"issue":"1","key":"54_CR19","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/TIT.2015.2503755","volume":"62","author":"D Sutter","year":"2016","unstructured":"Sutter, D., Sutter, T., Esfahani, P.M., Renner, R.: Efficient approximation of quantum channel capacities. IEEE Trans. Inf. Theory 62(1), 578\u2013598 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20134","key":"54_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a matlab software package for semidefinite programming. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"54_CR21","doi-asserted-by":"publisher","first-page":"052336","DOI":"10.1103\/PhysRevA.82.052336","volume":"82","author":"Y Zinchenko","year":"2010","unstructured":"Zinchenko, Y., Friedland, S., Gour, G.: Numerical estimation of the relative entropy of entanglement. Phys. Rev. A 82(5), 052336 (2010)","journal-title":"Phys. Rev. A"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0054-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0054-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0054-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T11:00:56Z","timestamp":1720868456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0054-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,15]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["54"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0054-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,15]]},"assertion":[{"value":"11 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}