{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T05:02:09Z","timestamp":1773810129492,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23K16844"],"award-info":[{"award-number":["23K16844"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["21H03398"],"award-info":[{"award-number":["21H03398"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Research Grants Council","award":["PolyU153001\/22p"],"award-info":[{"award-number":["PolyU153001\/22p"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper, without requiring any constraint qualifications, we establish tight error bounds for the log-determinant cone, which is the closure of the hypograph of the perspective function of the log-determinant function. This error bound is obtained using the recently developed framework based on one-step facial residual functions.<\/jats:p>","DOI":"10.1007\/s10957-025-02644-1","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:56:37Z","timestamp":1744214197000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tight Error Bounds for Log-Determinant Cones Without Constraint Qualifications"],"prefix":"10.1007","volume":"205","author":[{"given":"Ying","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4287-4788","authenticated-orcid":false,"given":"Scott B.","family":"Lindstrom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno F.","family":"Louren\u00e7o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"issue":"1","key":"2644_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"SD Ahipasaoglu","year":"2008","unstructured":"Ahipasaoglu, S.D., Sun, P., Todd, M.J.: Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23(1), 5\u201319 (2008)","journal-title":"Optim. Methods Softw."},{"key":"2644_CR2","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1214\/aoms\/1177697374","volume":"40","author":"CL Atwood","year":"1969","unstructured":"Atwood, C.L.: Optimal and efficient designs of experiments. Ann. Math. Stat. 40, 1570\u20131602 (1969)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"2644_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.2140\/pjm.1975.57.15","volume":"57","author":"GP Barker","year":"1975","unstructured":"Barker, G.P., Carlson, S.: Cones of diagonally dominant matrices. Pac. J. Math. 57(1), 15\u201332 (1975)","journal-title":"Pac. J. Math."},{"key":"2644_CR4","unstructured":"Bartels, S., Boomsma, W., Frellsen, J., Garreau, D.: Kernel-matrix determinant estimates from stopped cholesky decomposition. J. Mach. Learn. Res. 24, 71:1\u201371:57 (2023)"},{"issue":"3","key":"2644_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"issue":"1","key":"2644_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"HH Bauschke","year":"1999","unstructured":"Bauschke, H.H., Borwein, J.M., Li, W.: Strong conical hull intersection property, bounded linear regularity, Jameson\u2019s Property (G), and error bounds in convex optimization. Math. Program. 86(1), 135\u2013160 (1999)","journal-title":"Math. Program."},{"issue":"2","key":"2644_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83(2), 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"2644_CR8","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":"2644_CR9","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Solving natural conic formulations with Hypatia.jl. INFORMS J. Comput. 34, 2686\u20132699 (2022)","DOI":"10.1287\/ijoc.2022.1202"},{"issue":"4","key":"2644_CR10","first-page":"906","volume":"48","author":"C Coey","year":"2023","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Conic optimization with spectral functions on Euclidean Jordan algebras. Math. Oper. Res. 48(4), 906\u20131933 (2023)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2644_CR11","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)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2644_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/060670985","volume":"30","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Banerjee, O., El Ghaoui, L.: First-order methods for sparse covariance selection. SIAM J. Matrix Anal. Appl. 30(1), 56\u201366 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2644_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/2528966","volume":"28","author":"AP Dempster","year":"1972","unstructured":"Dempster, A.P.: Covariance selection. Biometrics 28(1), 157\u2013175 (1972)","journal-title":"Biometrics"},{"key":"2644_CR14","doi-asserted-by":"publisher","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. Clarendon Press, Oxford (1994)"},{"issue":"3","key":"2644_CR15","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"},{"key":"2644_CR16","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical Lasso. Biostatistics 9(3), 432\u2013441 (2008)","DOI":"10.1093\/biostatistics\/kxm045"},{"issue":"1","key":"2644_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/10556780903191165","volume":"26","author":"D Henrion","year":"2011","unstructured":"Henrion, D., Malick, J.: Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions. Optim. Methods Softw. 26(1), 23\u201346 (2011)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"2644_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4), 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"2644_CR19","volume-title":"Matrix Analysis","author":"RA Horn","year":"1990","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1990)"},{"key":"2644_CR20","doi-asserted-by":"crossref","unstructured":"Kulesza, A., Taskar, B.: Determinantal point processes for machine learning. Found. Trend\u00ae Mach. Learn. 5(23), 123\u2013286 (2012)","DOI":"10.1561\/2200000044"},{"key":"2644_CR21","doi-asserted-by":"crossref","unstructured":"Lewis, A.S., Pang, J.S.: Error bounds for convex inequality systems. In: Generalized Convexity. Generalized Monotonicity: Recent Results, pp. 75\u2013110. Springer, US (1998)","DOI":"10.1007\/978-1-4613-3341-8_3"},{"issue":"2","key":"2644_CR22","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/22M1542921","volume":"34","author":"Y Lin","year":"2024","unstructured":"Lin, Y., Lindstrom, S.B., Louren\u00e7o, B.F., Pong, T.K.: Generalized power cones: optimal error bounds and automorphisms. SIAM J. Optim. 34(2), 1316\u20131340 (2024)","journal-title":"SIAM J. Optim."},{"key":"2644_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10107-022-01883-8","volume":"200","author":"SB Lindstrom","year":"2023","unstructured":"Lindstrom, S.B., Louren\u00e7o, B.F., Pong, T.K.: Error bounds, facial residual functions and applications to the exponential cone. Math. Program. 200, 229\u2013278 (2023)","journal-title":"Math. Program."},{"key":"2644_CR24","doi-asserted-by":"crossref","unstructured":"Lindstrom, S.B., Louren\u00e7o, B.F., Pong, T.K.: Optimal error bounds in the absence of constraint qualifications with applications to the $$p$$-cones and beyond. To appear in Mathematics of Operations Research (2024)","DOI":"10.1287\/moor.2022.0135"},{"key":"2644_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10208-022-09586-4","volume":"24","author":"T Liu","year":"2024","unstructured":"Liu, T., Louren\u00e7o, B.F.: Convergence analysis under consistent error bounds. Found. Comput. Math. 24, 429\u2013479 (2024)","journal-title":"Found. Comput. Math."},{"key":"2644_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01439-3","volume":"186","author":"BF Louren\u00e7o","year":"2021","unstructured":"Louren\u00e7o, B.F.: Amenable cones: error bounds without constraint qualifications. Math. Program. 186, 1\u201348 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"2644_CR27","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1137\/15M1051634","volume":"28","author":"BF Louren\u00e7o","year":"2018","unstructured":"Louren\u00e7o, B.F., Muramatsu, M., Tsuchiya, T.: Facial reduction and partial polyhedrality. SIAM J. Optim. 28(3), 2304\u20132326 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2644_CR28","doi-asserted-by":"publisher","first-page":"2347","DOI":"10.1137\/20M138466X","volume":"32","author":"BF Louren\u00e7o","year":"2022","unstructured":"Louren\u00e7o, B.F., Roshchina, V., Saunderson, J.: Amenable cones are particularly nice. SIAM J. Optim. 32(3), 2347\u20132375 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2644_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"2644_CR30","unstructured":"MOSEK ApS. MOSEK Modeling Cookbook Release 3.3.0 (2022)"},{"key":"2644_CR31","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":"2644_CR32","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02614322","volume":"79","author":"J-S Pang","year":"1997","unstructured":"Pang, J.-S.: Error bounds in mathematical programming. Math. Program. 79(1), 299\u2013332 (1997)","journal-title":"Math. Program."},{"key":"2644_CR33","doi-asserted-by":"crossref","unstructured":"Pataki, G.: Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals. In: Computational and Analytical Mathematics. volume 50, pp. 613\u2013634. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-7621-4_28"},{"key":"2644_CR34","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3206.001.0001","volume-title":"Gaussian Processes for Machine Learning","author":"CR Rasmussen","year":"2005","unstructured":"Rasmussen, C.R., Williams, C.K.I.: Gaussian Processes for Machine Learning. The MIT Press, Cambridge, MA (2005)"},{"key":"2644_CR35","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, New Jersey (1997)"},{"key":"2644_CR36","doi-asserted-by":"publisher","DOI":"10.1201\/9780203492024","volume-title":"Gaussian Markov Random Fields: Theory and Applications","author":"H Rue","year":"2005","unstructured":"Rue, H., Held, L.: Gaussian Markov Random Fields: Theory and Applications. Chapman and Hall\/CRC, New York (2005)"},{"issue":"4","key":"2644_CR37","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1137\/S1052623498338606","volume":"10","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Error bounds for linear matrix inequalities. SIAM J. Optim. 10(4), 1228\u20131248 (2000)","journal-title":"SIAM J. Optim."},{"key":"2644_CR38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974386","volume-title":"Minimum-Volume Ellipsoids: Theory and Algorithms","author":"MJ Todd","year":"2016","unstructured":"Todd, M.J.: Minimum-Volume Ellipsoids: Theory and Algorithms. SIAM, Philadelphia (2016)"},{"issue":"1","key":"2644_CR39","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/wics.19","volume":"1","author":"S Van Aelst","year":"2009","unstructured":"Van Aelst, S., Rousseeuw, P.: Minimum volume ellipsoid. Wiley Interdiscip. Rev. Comput. Stat. 1(1), 71\u201382 (2009)","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"issue":"1","key":"2644_CR40","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10957-012-0219-y","volume":"158","author":"H Waki","year":"2013","unstructured":"Waki, H., Muramatsu, M.: Facial reduction algorithms for conic optimization problems. J. Optim. Theory Appl. 158(1), 188\u2013215 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"2644_CR41","doi-asserted-by":"crossref","unstructured":"Yang, S., Zhaosong, L., Shen, X., Wonka, P., Ye, J.: Fused multiple graphical Lasso. SIAM J. Optim. 25(2), 916\u2013943 (2015)","DOI":"10.1137\/130936397"},{"key":"2644_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, N., Zhang, Y., Sun, D., Toh, K.-C.: An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems. SIAM J. Math. Data Sci. 3(2), 524\u2013543 (2021)","DOI":"10.1137\/20M1344160"},{"key":"2644_CR43","doi-asserted-by":"crossref","unstructured":"Zhou, Z., So, A.M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689\u2013728 (2017)","DOI":"10.1007\/s10107-016-1100-9"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02644-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02644-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02644-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T06:02:29Z","timestamp":1746770549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02644-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,9]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2644"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02644-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,9]]},"assertion":[{"value":"12 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"45"}}