{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T10:10:10Z","timestamp":1780308610503,"version":"3.54.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10589-026-00770-8","type":"journal-article","created":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T15:25:55Z","timestamp":1771082755000},"page":"439-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable approximate optimal diagonal preconditioning"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0067-4488","authenticated-orcid":false,"given":"Wenzhi","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhaonan","family":"Qu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madeleine","family":"Udell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"770_CR1","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1007\/s11590-020-01561-8","volume":"14","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., Boyd, S.: Disciplined quasiconvex programming. Optimization Letters 14, 1643\u20131657 (2020)","journal-title":"Optimization Letters"},{"issue":"2\u20133","key":"770_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0168-9274(98)00118-4","volume":"30","author":"M Benzi","year":"1999","unstructured":"Benzi, M., Tuma, M.: A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math. 30(2\u20133), 305\u2013340 (1999)","journal-title":"Appl. Numer. Math."},{"issue":"5\u20136","key":"770_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1002\/nla.320","volume":"10","author":"M Benzi","year":"2003","unstructured":"Benzi, M., Tuma, M.: A robust incomplete factorization preconditioner for positive definite matrices. Numerical Linear Algebra with Applications 10(5\u20136), 385\u2013400 (2003)","journal-title":"Numerical Linear Algebra with Applications"},{"issue":"6","key":"770_CR4","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1137\/S0363012992238680","volume":"32","author":"RD Braatz","year":"1994","unstructured":"Braatz, R.D., Morari, M.: Minimizing the Euclidean condition number. SIAM J. Control. Optim. 32(6), 1763\u20131768 (1994)","journal-title":"SIAM J. Control. Optim."},{"key":"770_CR5","volume-title":"Algorithms for the equilibration of matrices and their application to limited-memory Quasi-Newton methods","author":"AM Bradley","year":"2010","unstructured":"Bradley, A.M.: Algorithms for the equilibration of matrices and their application to limited-memory Quasi-Newton methods. Stanford University, CA, Tech. rep. (2010)"},{"issue":"2","key":"770_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"issue":"6","key":"770_CR7","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1002\/nme.1461","volume":"65","author":"X Chen","year":"2006","unstructured":"Chen, X., Toh, K.C., Phoon, K.K.: A modified SSOR preconditioner for sparse symmetric indefinite linear systems of equations. Int. J. Numer. Meth. Eng. 65(6), 785\u2013807 (2006)","journal-title":"Int. J. Numer. Meth. Eng."},{"issue":"1","key":"770_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1137\/100786022","volume":"21","author":"X Chen","year":"2011","unstructured":"Chen, X., Womersley, R.S., Ye, J.J.: Minimizing the condition number of a Gram matrix. SIAM J. Optim. 21(1), 127\u2013148 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"770_CR9","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0716029","volume":"16","author":"AK Cline","year":"1979","unstructured":"Cline, A.K., Moler, C.B., Stewart, G.W., Wilkinson, J.H.: An estimate for the condition number of a matrix. SIAM J. Numer. Anal. 16(2), 368\u2013375 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"770_CR10","unstructured":"Deng, Q., Feng, Q., Gao, W., Ge, D., Jiang, B., Jiang, Y., Liu, J., Liu, T., Xue, C., Ye, Y., et\u00a0al.: (2022) New developments of ADMM-based interior point methods for linear programming and conic programming. arXiv preprint arXiv:2209.01793"},{"key":"770_CR11","first-page":"18272","volume":"33","author":"M Derezinski","year":"2020","unstructured":"Derezinski, M., Liang, F.T., Liao, Z., Mahoney, M.W.: Precise expressions for random projections: Low-rank approximation and randomized newton. Adv. Neural. Inf. Process. Syst. 33, 18272\u201318283 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"770_CR12","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/21M1402340","volume":"33","author":"L Ding","year":"2023","unstructured":"Ding, L., Grimmer, B.: Revisiting spectral bundle methods: Primal-dual (sub)linear convergence rates. SIAM J. Optim. 33(2), 1305\u20131332 (2023)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"770_CR13","doi-asserted-by":"publisher","first-page":"2614","DOI":"10.1137\/20M1346262","volume":"31","author":"L Ding","year":"2021","unstructured":"Ding, L., Udell, M.: On the simplicity and conditioning of low rank semidefinite programs. SIAM J. Optim. 31(4), 2614\u20132637 (2021)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"770_CR14","doi-asserted-by":"publisher","first-page":"2695","DOI":"10.1137\/19M1244603","volume":"31","author":"L Ding","year":"2021","unstructured":"Ding, L., Yurtsever, A., Cevher, V., Tropp, J.A., Udell, M.: An optimal-storage approach to semidefinite programming using approximate complementarity. SIAM J. Optim. 31(4), 2695\u20132725 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"770_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02145580","volume":"1","author":"WR Ferng","year":"1991","unstructured":"Ferng, W.R., Golub, G.H., Plemmons, R.J.: Adaptive Lanczos methods for recursive condition estimation. Numerical Algorithms 1(1), 1\u201319 (1991)","journal-title":"Numerical Algorithms"},{"issue":"2","key":"770_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/21M1466244","volume":"44","author":"Z Frangella","year":"2023","unstructured":"Frangella, Z., Tropp, J.A., Udell, M.: Randomized Nystr\u00f6m preconditioning. SIAM J. Matrix Anal. Appl. 44(2), 718\u2013752 (2023)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"770_CR17","doi-asserted-by":"crossref","unstructured":"Gao W, Ge D, Ye Y (2025) Algorithm 1055: HDSDP-software for semidefinite programming. ACM Transactions on Mathematical Software 51(2)","DOI":"10.1145\/3721123"},{"key":"770_CR18","unstructured":"Ge D, Huangfu Q, Wang Z, Wu J, Ye Y (2022) Cardinal Optimizer (COPT) user guide. arXiv preprint arXiv:2208.14314"},{"key":"770_CR19","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Diagonal scaling in Douglas-Rachford splitting and admm. In: 53rd IEEE Conference on Decision and Control, IEEE, pp 5033\u20135039 (2014)","DOI":"10.1109\/CDC.2014.7040175"},{"issue":"4","key":"770_CR20","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/BF01932737","volume":"29","author":"A Greenbaum","year":"1989","unstructured":"Greenbaum, A., Rodrigue, G.H.: Optimal preconditioners of a given sparsity pattern. BIT Numer. Math. 29(4), 610\u2013634 (1989)","journal-title":"BIT Numer. Math."},{"key":"770_CR21","unstructured":"Gurobi Optimization LLC (2021) Gurobi Optimizer Reference Manual"},{"issue":"3","key":"770_CR22","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"770_CR23","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"20","key":"770_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/asna.18450222002","volume":"22","author":"CG Jacobi","year":"1845","unstructured":"Jacobi, C.G.: Ueber eine neue aufl\u00f6sungsart der bei der methode der kleinsten quadrate vorkommenden linearen gleichungen. Astron. Nachr. 22(20), 297\u2013306 (1845)","journal-title":"Astron. Nachr."},{"key":"770_CR25","unstructured":"Jambulapati, A., Li, J., Musco, C., Sidford, A., Tian, K.: (2020) Fast and near-optimal diagonal preconditioning. arXiv preprint arXiv:2008.01722"},{"key":"770_CR26","doi-asserted-by":"crossref","unstructured":"Jambulapati, A., Li, J., Musco, C., Shiragur, K., Sidford, A., Tian, K.: Structured semidefinite programming for recovering structured preconditioners. arXiv preprint (2023) arXiv:2310.18265","DOI":"10.52202\/075280-0743"},{"issue":"3","key":"770_CR27","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1093\/imanum\/drs019","volume":"33","author":"PA Knight","year":"2013","unstructured":"Knight, P.A., Ruiz, D.: A fast algorithm for matrix balancing. IMA J. Numer. Anal. 33(3), 1029\u20131047 (2013)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"770_CR28","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1137\/110825753","volume":"35","author":"PA Knight","year":"2014","unstructured":"Knight, P.A., Ruiz, D., U\u00e7ar, B.: A symmetry preserving algorithm for matrix scaling. SIAM J. Matrix Anal. Appl. 35(3), 931\u2013955 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"35","key":"770_CR29","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.21105\/joss.01244","volume":"4","author":"SP Kolodziej","year":"2019","unstructured":"Kolodziej, S.P., Aznaveh, M., Bullock, M., David, J., Davis, T.A., Henderson, M., Hu, Y., Sandstrom, R.: The suitesparse matrix collection website interface. Journal of Open Source Software 4(35), 1244 (2019)","journal-title":"Journal of Open Source Software"},{"key":"770_CR30","unstructured":"Krishnan, K., Mitchell, J.E.: Properties of a cutting plane method for semidefinite programming. submitted for publication (2003)"},{"key":"770_CR31","unstructured":"Kunstner, F., Portella, V.S., Schmidt, M., Harvey, N.: Searching for optimal per-coordinate step-sizes with multidimensional backtracking. In: Thirty-seventh Conference on Neural Information Processing Systems, (2023) https:\/\/openreview.net\/forum?id=wzPcffMZ3b"},{"key":"770_CR32","doi-asserted-by":"crossref","unstructured":"Lemon, A., So, A.M.C., Ye, Y.: Low-rank semidefinite programming: Theory and applications. Foundations and Trends\u00ae in Optimization 2(1-2):1\u2013156 (2016)","DOI":"10.1561\/2400000009"},{"key":"770_CR33","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.laa.2021.06.010","volume":"626","author":"L Liberti","year":"2021","unstructured":"Liberti, L., Poirion, P.L., Vu, K.: Random projections for conic programs. Linear Algebra Appl. 626, 204\u2013220 (2021)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"770_CR34","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/100795097","volume":"32","author":"Z Lu","year":"2011","unstructured":"Lu, Z., Pong, T.K.: Minimizing condition number via convex programming. SIAM J. Matrix Anal. Appl. 32(4), 1193\u20131211 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"770_CR35","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"issue":"2","key":"770_CR36","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/080740544","volume":"20","author":"P Mar\u00e9chal","year":"2009","unstructured":"Mar\u00e9chal, P., Ye, J.J.: Optimizing condition numbers. SIAM J. Optim. 20(2), 935\u2013947 (2009)","journal-title":"SIAM J. Optim."},{"key":"770_CR37","doi-asserted-by":"crossref","unstructured":"Menard, S.: Applied logistic regression analysis. 106, Sage (2002)","DOI":"10.4135\/9781412983433"},{"key":"770_CR38","doi-asserted-by":"crossref","unstructured":"O\u2019donoghue B, Chu E, Parikh N, Boyd S: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169, 1042\u20131068 (2016)","DOI":"10.1007\/s10957-016-0892-3"},{"key":"770_CR39","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-006-0727-3","volume":"109","author":"MR Oskoorouchi","year":"2007","unstructured":"Oskoorouchi, M.R., Goffin, J.L.: A matrix generation approach for eigenvalue optimization. Math. Program. 109, 155\u2013179 (2007)","journal-title":"Math. Program."},{"issue":"5","key":"770_CR40","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1287\/opre.1110.0951","volume":"59","author":"MR Oskoorouchi","year":"2011","unstructured":"Oskoorouchi, M.R., Ghaffari, H.R., Terlaky, T., Aleman, D.M.: An interior point constraint generation algorithm for semi-infinite optimization with health-care application. Oper. Res. 59(5), 1184\u20131197 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"770_CR41","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"ML Overton","year":"1992","unstructured":"Overton, M.L.: Large-scale optimization of eigenvalues. SIAM J. Optim. 2(1), 88\u2013120 (1992)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"770_CR42","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2), 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"key":"770_CR43","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal-dual algorithms in convex optimization. In: 2011 International Conference on Computer Vision, IEEE, pp 1762\u20131769 (2011)","DOI":"10.1109\/ICCV.2011.6126441"},{"issue":"3","key":"770_CR44","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1287\/opre.2022.0592","volume":"73","author":"Z Qu","year":"2025","unstructured":"Qu, Z., Gao, W., Hinder, O., Ye, Y., Zhou, Z.: Optimal diagonal preconditioning: Theory and practice. Oper. Res. 73(3), 1479\u20131495 (2025)","journal-title":"Oper. Res."},{"key":"770_CR45","unstructured":"Ruiz, D.: A scaling algorithm to equilibrate both rows and columns norms in matrices. Tech. rep., CM-P00040415 (2001)"},{"key":"770_CR46","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods for sparse linear systems, vol\u00a082. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"770_CR47","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01408697","volume":"39","author":"A Shapiro","year":"1982","unstructured":"Shapiro, A.: Optimally scaled matrices, necessary and sufficient conditions. Numer. Math. 39, 239\u2013245 (1982)","journal-title":"Numer. Math."},{"key":"770_CR48","doi-asserted-by":"crossref","unstructured":"Sivaramakrishnan, K.K.: Linear programming approaches to semidefinite programming problems. Rensselaer Polytechnic Institute (2002)","DOI":"10.1090\/fic\/037\/08"},{"issue":"1","key":"770_CR49","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF02165096","volume":"14","author":"A Van der Sluis","year":"1969","unstructured":"Van der Sluis, A.: Condition numbers and equilibration of matrices. Numer. Math. 14(1), 14\u201323 (1969)","journal-title":"Numer. Math."},{"key":"770_CR50","unstructured":"Takapoui, R., Javadi, H.: Preconditioning via diagonal scaling. arXiv preprint (2016) arXiv:1610.03871"},{"key":"770_CR51","volume-title":"Practical first order methods for large scale semidefinite programming","author":"S Tu","year":"2014","unstructured":"Tu, S., Wang, J.: Practical first order methods for large scale semidefinite programming. Technical report, University of California, Berkeley, Tech. rep. (2014)"},{"issue":"3","key":"770_CR52","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1137\/20M1331470","volume":"42","author":"JC Urschel","year":"2021","unstructured":"Urschel, J.C.: Uniform error estimates for the Lanczos method. SIAM J. Matrix Anal. Appl. 42(3), 1423\u20131450 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"770_CR53","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1093\/imanum\/11.4.481","volume":"11","author":"G Watson","year":"1991","unstructured":"Watson, G.: An algorithm for optimal $$\\ell ^2$$ scaling of matrices. IMA J. Numer. Anal. 11(4), 481\u2013492 (1991)","journal-title":"IMA J. Numer. Anal."},{"key":"770_CR54","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming: theory, algorithms, and applications, vol\u00a027. Springer Science & Business Media (2012)"},{"key":"770_CR55","volume-title":"Interior point algorithms: theory and analysis","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: Interior point algorithms: theory and analysis. John Wiley & Sons (2011)"},{"issue":"1","key":"770_CR56","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1137\/19M1305045","volume":"3","author":"A Yurtsever","year":"2021","unstructured":"Yurtsever, A., Tropp, J.A., Fercoq, O., Udell, M., Cevher, V.: Scalable semidefinite programming. SIAM Journal on Mathematics of Data Science 3(1), 171\u2013200 (2021)","journal-title":"SIAM Journal on Mathematics of Data Science"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00770-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-026-00770-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00770-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T09:56:51Z","timestamp":1780307811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-026-00770-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,14]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["770"],"URL":"https:\/\/doi.org\/10.1007\/s10589-026-00770-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,14]]},"assertion":[{"value":"9 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}