{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:03:55Z","timestamp":1743048235352,"version":"3.40.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T00:00:00Z","timestamp":1741392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T00:00:00Z","timestamp":1741392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","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":[[2025,5]]},"DOI":"10.1007\/s10589-025-00669-w","type":"journal-article","created":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:57:12Z","timestamp":1741442232000},"page":"235-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The $$\\omega $$-condition number: applications to preconditioning and low rank generalized Jacobian updating"],"prefix":"10.1007","volume":"91","author":[{"given":"Woosuk L.","family":"Jung","sequence":"first","affiliation":[]},{"given":"David","family":"Torregrosa-Bel\u00e9n","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-3060","authenticated-orcid":false,"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,8]]},"reference":[{"key":"669_CR1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.3390\/a13040100","volume":"13","author":"L Bergamaschi","year":"2020","unstructured":"Bergamaschi, L.: A survey of low-rank updates of preconditioners for sequences of symmetric linear systems. Algorithms 13, 100 (2020)","journal-title":"Algorithms"},{"key":"669_CR2","doi-asserted-by":"crossref","unstructured":"Bergamaschi, L., Bru, R., Mart\u00ednez, A.: Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian. Math. Comput. Model. 54, 1863\u20131873 (2011). (Mathematical models of addictive behaviour, medicine & engineering)","DOI":"10.1016\/j.mcm.2010.11.064"},{"key":"669_CR3","unstructured":"Censor, Y., Moursi, W., Weames, T., Wolkowicz, H.: Regularized nonsmooth Newton algorithms for best approximation with applications, (2023). arXiv:2212.13182"},{"key":"669_CR4","series-title":"Cambridge Monographs on Applied and Computational Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543258","volume-title":"Matrix Preconditioning Techniques and Applications","author":"K Chen","year":"2005","unstructured":"Chen, K.: Matrix Preconditioning Techniques and Applications. Cambridge Monographs on Applied and Computational Mathematics, vol. 19. Cambridge University Press, Cambridge (2005)"},{"key":"669_CR5","doi-asserted-by":"crossref","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, 127\u2013148 (2011)","journal-title":"SIAM J. Optim."},{"key":"669_CR6","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1007\/s10957-023-02194-4","volume":"197","author":"S Cipolla","year":"2023","unstructured":"Cipolla, S., Gondzio, J.: Proximal Stabilized Interior Point Methods and $$Low-Frequency-Update$$ Preconditioning Techniques. J. Optim. Theory Appl. 197, 1061\u20131103 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"669_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01681328","volume":"9","author":"WC Davidon","year":"1975","unstructured":"Davidon, W.C.: Optimally conditioned optimization algorithms without line searches. Math. Program. 9, 1\u201330 (1975)","journal-title":"Math. Program."},{"key":"669_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01400115","volume":"51","author":"J Demmel","year":"1987","unstructured":"Demmel, J.: On condition numbers and the distance to the nearest ill-posed problem. Numer. Math. 51, 251\u2013289 (1987)","journal-title":"Numer. Math."},{"key":"669_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1090\/S0025-5718-1988-0929546-7","volume":"50","author":"J Demmel","year":"1988","unstructured":"Demmel, J.: The probability that a numerical analysis problem is difficult. Math. Comput. 50, 449\u2013480 (1988)","journal-title":"Math. Comput."},{"key":"669_CR10","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/1021091","volume":"21","author":"J Dennis Jr","year":"1979","unstructured":"Dennis, J., Jr., Schnabel, R.: Least change secant updates for quasi-Newton methods. SIAM Rev. 21, 443\u2013459 (1979)","journal-title":"SIAM Rev."},{"key":"669_CR11","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"J Dennis Jr","year":"1993","unstructured":"Dennis, J., Jr., Wolkowicz, H.: Sizing and least-change secant methods. SIAM J. Numer. Anal. 30, 1291\u20131314 (1993)","journal-title":"SIAM J. Numer. Anal."},{"key":"669_CR12","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1080\/10556788.2011.610456","volume":"27","author":"X Doan","year":"2012","unstructured":"Doan, X., Kruk, S., Wolkowicz, H.: A robust algorithm for semidefinite programming. Optim. Methods Softw. 27, 667\u2013693 (2012)","journal-title":"Optim. Methods Softw."},{"key":"669_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"669_CR14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.4169\/math.mag.85.2.116","volume":"85","author":"W Freedman","year":"2012","unstructured":"Freedman, W.: Minimizing areas and volumes and a generalized AM-GM inequality. Math. Mag. 85, 116\u2013123 (2012)","journal-title":"Math. Mag."},{"key":"669_CR15","unstructured":"Gao, W., Qu, Z., Udell, M., Ye, Y.: Scalable approximate optimal diagonal preconditioning, (2023). arXiv:2312.15594"},{"key":"669_CR16","series-title":"Johns Hopkins Studies in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"G Golub","year":"2013","unstructured":"Golub, G., Van Loan, C.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"669_CR17","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10589-022-00424-5","volume":"83","author":"J Gondzio","year":"2022","unstructured":"Gondzio, J., Pougkakiotis, S., Pearson, J.: General-purpose preconditioning for regularized interior point methods. Comput. Optim. Appl. 83, 727\u2013757 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"669_CR18","first-page":"1","volume":"43","author":"N Gould","year":"2017","unstructured":"Gould, N., Scott, J.: The state-of-the-art of preconditioners for sparse linear least-square problems. ACM Trans. Math. Softw. 43, 1\u201335 (2017)","journal-title":"ACM Trans. Math. Softw."},{"key":"669_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970937","volume-title":"Iterative Methods for Solving Linear Systems","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative Methods for Solving Linear Systems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)"},{"key":"669_CR20","doi-asserted-by":"crossref","unstructured":"Greif, C., Varah, J.M.: Minimizing the condition number for small rank modifications. SIAM J. Matrix Anal. Appl. 29, 82\u201397 (2006\/07)","DOI":"10.1137\/050647554"},{"key":"669_CR21","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0902031","volume":"2","author":"R Grimes","year":"1981","unstructured":"Grimes, R., Lewis, J.: Condition number estimation for sparse matrices. SIAM J. Sci. Stat. Comput. 2, 384\u2013388 (1981)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"669_CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/0905023","volume":"5","author":"WW Hager","year":"1984","unstructured":"Hager, W.W.: Condition estimates. SIAM J. Sci. Stat. Comput. 5, 311\u2013316 (1984)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"669_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0024-3795(93)00066-9","volume":"214","author":"D Higham","year":"1995","unstructured":"Higham, D.: Condition numbers and their condition numbers. Linear Algebra Appl. 214, 193\u2013213 (1995)","journal-title":"Linear Algebra Appl."},{"key":"669_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/1029112","volume":"29","author":"N Higham","year":"1987","unstructured":"Higham, N.: A survey of condition number estimation for triangular matrices. SIAM Rev. 29, 575\u2013596 (1987)","journal-title":"SIAM Rev."},{"key":"669_CR25","doi-asserted-by":"crossref","unstructured":"Higham, N., Tisseur, F.: A block algorithm for matrix 1-norm estimation, with an application to 1-norm pseudospectra. SIAM J. Matrix Anal. Appl. 21, 1185\u20131201 (2000)","DOI":"10.1137\/S0895479899356080"},{"key":"669_CR26","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1287\/moor.2023.1382","volume":"49","author":"H Hu","year":"2024","unstructured":"Hu, H., Im, H., Li, X., Wolkowicz, H.: A semismooth Newton-type method for the nearest doubly stochastic matrix problem. Math. Oper. Res. 49, 729\u2013751 (2024)","journal-title":"Math. Oper. Res."},{"key":"669_CR27","doi-asserted-by":"crossref","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. J. Open Source Softw. 4, 1244 (2019)","journal-title":"J. Open Source Softw."},{"key":"669_CR28","volume-title":"Nonlinear Programming","author":"O Mangasarian","year":"1969","unstructured":"Mangasarian, O.: Nonlinear Programming. McGraw-Hill, New York (1969)"},{"key":"669_CR29","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/0025570X.1981.11976898","volume":"54","author":"KS Miller","year":"1981","unstructured":"Miller, K.S.: On the inverse of the sum of matrices. Math. Mag. 54, 67\u201372 (1981)","journal-title":"Math. Mag."},{"key":"669_CR30","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1287\/mnsc.20.5.845","volume":"20","author":"SS Oren","year":"1974","unstructured":"Oren, S.S., Luenberger, D.G.: Self-scaling variable metric (SSVM) algorithms: Part I: criteria and sufficient conditions for scaling a class of algorithms. Manag. Sci. 20, 845\u2013862 (1974)","journal-title":"Manag. Sci."},{"key":"669_CR31","doi-asserted-by":"crossref","first-page":"e202000015, 35","DOI":"10.1002\/gamm.202000015","volume":"43","author":"J Pearson","year":"2020","unstructured":"Pearson, J., Pestana, J.: Preconditioners for Krylov subspace methods: an overview. GAMM-Mitt. 43, e202000015, 35 (2020)","journal-title":"GAMM-Mitt."},{"key":"669_CR32","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0309-1708(90)90006-P","volume":"13","author":"G Pini","year":"1990","unstructured":"Pini, G., Gambolati, G.: Is a simple diagonal scaling the best preconditioner for conjugate gradients on supercomputers? Adv. Water Resour. 13, 147\u2013153 (1990)","journal-title":"Adv. Water Resour."},{"key":"669_CR33","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28, 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"669_CR34","unstructured":"Schnabel, R.: Analysing and improving quasi-Newton methods for unconstrained optimization, PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, (1977). Also available as TR-77-320"},{"key":"669_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5592-3","volume-title":"Introduction to Numerical Analysis","author":"J Stoer","year":"1980","unstructured":"Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis, vol. 1993. Springer, Berlin (1980)"},{"key":"669_CR36","unstructured":"Strang, G.: Linear Algebra and Its Applications 4th ed., (2012)"},{"key":"669_CR37","doi-asserted-by":"crossref","unstructured":"van der Sluis, A.: Condition numbers and equilibration of matrices. Numer. Math. 14, 14\u201323 (1969\/1970)","DOI":"10.1007\/BF02165096"},{"key":"669_CR38","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1016\/j.jcp.2016.09.001","volume":"326","author":"L Wu","year":"2016","unstructured":"Wu, L., Laeuchli, J., Kalantzis, V., Stathopoulos, A., Gallopoulos, E.: Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse. J. Comput. Phys. 326, 828\u2013844 (2016)","journal-title":"J. Comput. Phys."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00669-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00669-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00669-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:40:50Z","timestamp":1742960450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00669-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,8]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["669"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00669-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,3,8]]},"assertion":[{"value":"23 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}