{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T15:48:16Z","timestamp":1769096896205,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS1943131"],"award-info":[{"award-number":["IIS1943131"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1740822"],"award-info":[{"award-number":["CCF-1740822"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-17-2-0101"],"award-info":[{"award-number":["FA8750-17-2-0101"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000024","name":"Canadian Institutes of Health Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000024","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004705","name":"Capital One Financial Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004705","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11590-022-01942-1","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T04:26:41Z","timestamp":1667536001000},"page":"1551-1574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A strict complementarity approach to error bound and sensitivity of solution of conic programs"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2667-3337","authenticated-orcid":false,"given":"Lijun","family":"Ding","sequence":"first","affiliation":[]},{"given":"Madeleine","family":"Udell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"key":"1942_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"1942_CR2","unstructured":"Lewis, A.: Nonsmooth optimization: conditioning, convergence and semialgebraic models. In: Proceedings of the International Congress of Mathematicians, Seoul, vol. 4, pp. 872\u2013895 (2014)"},{"key":"1942_CR3","unstructured":"Ding, L., Udell, M.: On the simplicity and conditioning of low rank semidefinite programs. arXiv preprint arXiv:2002.10673 (2020)"},{"issue":"3","key":"1942_CR4","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919 (2018)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1942_CR5","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689 (2017)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1942_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175(1\u20132), 69 (2019)","journal-title":"Math. Program."},{"key":"1942_CR7","unstructured":"Johnstone, P.R., Moulin, P.: Faster Subgradient Methods for Functions with H\u00f6lderian Growth. arXiv preprint arXiv:1704.00196 (2017)"},{"issue":"4","key":"1942_CR8","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."},{"issue":"4","key":"1942_CR9","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 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1942_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s101070050070","volume":"85","author":"MV Nayakkankuppam","year":"1999","unstructured":"Nayakkankuppam, M.V., Overton, M.L.: Conditioning of semidefinite programs. Math. Program. 85(3), 525 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"1942_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/moor.2016.0793","volume":"42","author":"M D\u00fcr","year":"2017","unstructured":"D\u00fcr, M., Jargalsaikhan, B., Still, G.: Genericity results in linear conic programming\u2014a tour d\u2019horizon. Math. Oper. Res. 42(1), 77 (2017)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1942_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02614432","volume":"77","author":"F Alizadeh","year":"1997","unstructured":"Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77(1), 111 (1997)","journal-title":"Math. Program."},{"key":"1942_CR13","first-page":"53","volume-title":"Linear Inequalities and Related Systems","author":"AJ Goldman","year":"1956","unstructured":"Goldman, A.J., Tucker, A.W.: Theory of linear programming. In: Kuhn, H.W., Tucker, A.W.\n(eds.) Linear Inequalities and Related Systems, pp. 53\u201397. Princeton University Press, New Jersey  (1956)"},{"issue":"1","key":"1942_CR14","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 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"1942_CR15","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1137\/S105262349834429X","volume":"10","author":"S Zhang","year":"2000","unstructured":"Zhang, S.: Global error bounds for convex conic problems. SIAM J. Optim. 10(3), 836 (2000)","journal-title":"SIAM J. Optim."},{"key":"1942_CR16","doi-asserted-by":"crossref","unstructured":"Drusvyatskiy, D., Wolkowicz, H.: The many faces of degeneracy in conic optimization. arXiv preprint arXiv:1706.03705 (2017)","DOI":"10.1561\/9781680833911"},{"issue":"3","key":"1942_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S1446788700017250","volume":"30","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Facial reduction for a cone-convex programming problem. J. Aust. Math. Soc. 30(3), 369 (1981)","journal-title":"J. Aust. Math. Soc."},{"issue":"2","key":"1942_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10208-016-9341-9","volume":"18","author":"AS Bandeira","year":"2018","unstructured":"Bandeira, A.S.: Random Laplacian matrices and convex relaxations. Found. Comput. Math. 18(2), 345 (2018)","journal-title":"Found. Comput. Math."},{"key":"1942_CR19","unstructured":"Ding, L., Yurtsever, A., Cevher, V., Tropp, J.A., Udell, M.: An optimal-storage approach to semidefinite programming using approximate complementarity. arXiv preprint arXiv:1902.03373 (2019)"},{"issue":"1","key":"1942_CR20","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), 1\u201348 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1942_CR21","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/15M1020770","volume":"26","author":"D Drusvyatskiy","year":"2016","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Generic minimizing behavior in semialgebraic optimization. SIAM J. Optim. 26(1), 513 (2016)","journal-title":"SIAM J. Optim."},{"key":"1942_CR22","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4hcj","volume-title":"Nonlinear Optimization","author":"A Ruszczynski","year":"2011","unstructured":"Ruszczynski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2011)"},{"key":"1942_CR23","volume-title":"Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications","author":"D Klatte","year":"2006","unstructured":"Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications, vol. 60. Springer, Berlin (2006)"},{"key":"1942_CR24","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2013","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, Berlin (2013)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01942-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01942-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01942-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T13:24:56Z","timestamp":1689168296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01942-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,4]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1942"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01942-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,4]]},"assertion":[{"value":"2 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}