{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:35:33Z","timestamp":1787330133244,"version":"build-2736575974"},"reference-count":107,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"crossref","award":["P2ELP2 187955"],"award-info":[{"award-number":["P2ELP2 187955"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"crossref","award":["200021 178865\/1"],"award-info":[{"award-number":["200021 178865\/1"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]},{"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\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-11-1-0025"],"award-info":[{"award-number":["N00014-11-1-0025"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-17-1-2146"],"award-info":[{"award-number":["N00014-17-1-2146"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2363"],"award-info":[{"award-number":["N00014-18-1-2363"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1846088"],"award-info":[{"award-number":["IIS-1846088"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Journal on Mathematics of Data Science"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct randomized algorithm for solving large, weakly constrained SDP problems by economizing on the storage and arithmetic costs. Numerical evidence shows that the method is effective for a range of applications, including relaxations of \\sf MaxCut, abstract phase retrieval, and quadratic assignment. Running on a laptop equivalent, the algorithm can handle SDP instances where the matrix variable has over $10^{14}$ entries.<\/jats:p>","DOI":"10.1137\/19m1305045","type":"journal-article","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T15:45:25Z","timestamp":1612799125000},"page":"171-200","source":"Crossref","is-referenced-by-count":86,"title":["Scalable Semidefinite Programming"],"prefix":"10.1137","volume":"3","author":[{"given":"Alp","family":"Yurtsever","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1024-1791","authenticated-orcid":true,"given":"Joel A.","family":"Tropp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3393-9757","authenticated-orcid":true,"given":"Olivier","family":"Fercoq","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3985-915X","authenticated-orcid":true,"given":"Madeleine","family":"Udell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"Absil P.-A.","year":"2007","journal-title":"Found. Comput. Math."},{"key":"atypb2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1008655427845","volume":"12","author":"Alfakih A. Y.","year":"1999","journal-title":"Comput. Optim. Appl."},{"key":"atypb3","unstructured":"F. Alizadeh,\n                      Combinatorial Optimization with Interior Point Methods and Semi-Definite Matrices\n                      , Ph.D. thesis, University of Minnesota, 1991."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/0805002"},{"key":"atypb5","first-page":"111","volume":"77","author":"Alizadeh F.","year":"1997","journal-title":"Math. Program."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496304700"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"Z. Allen-Zhu, Y. T. Lee, and L. Orecchia,\n                      Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver\n                      ,https:\/\/arxiv.org\/abs\/1507.02259, 2015.","DOI":"10.1137\/1.9781611974331.ch127"},{"key":"atypb8","unstructured":"Z. Allen-Zhu and Y. Li,\n                      Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU\n                      ,https:\/\/arxiv.org\/abs\/1701.01722, 2017."},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"M. F. Anjos and J. B. Lasserre,\n                      Handbook on Semidefinite, Conic and Polynomial Optimization\n                      , Springer, New York, 2012.","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"atypb10","first-page":"339","author":"Arora S.","year":"2005","journal-title":"Washington, DC"},{"key":"atypb11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2837020","volume":"63","author":"Arora S.","year":"2016","journal-title":"J. ACM"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"D. Bader, H. Meyerhenke, P. Sanders, and D. Wagner,\n                      Graph partitioning and graph clustering\n                      , in 10th DIMACS Implementation Challenge Workshop, 2012,https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/DIMACS10\/index.html.","DOI":"10.1090\/conm\/588"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/11085801X"},{"key":"atypb14","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/s00041-009-9065-1","volume":"15","author":"Balan R.","year":"2009","journal-title":"J. Fourier Anal. Appl."},{"key":"atypb15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.acha.2005.07.001","volume":"20","author":"Balan R.","year":"2006","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"A. Barvinok,\n                      A Course in Convexity\n                      , AMS, Providence, RI, 2002.","DOI":"10.1090\/gsm\/054"},{"key":"atypb17","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal and A. Nemirovski,\n                      Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications\n                      , MOS-SIAM Ser. Optim. Z, SIAM, Philadelphia, 2001.","DOI":"10.1137\/1.9780898718829"},{"key":"atypb18","unstructured":"D. P. Bertsekas,\n                      Constrained Optimization and Lagrange Multiplier Methods\n                      , Comput. Sci. Appl. Math., Academic Press, New York, 1982."},{"key":"atypb19","first-page":"3243","volume":"75","author":"Bhojanapalli S.","year":"2018","journal-title":"PMLR"},{"key":"atypb20","first-page":"1455","volume":"15","author":"Boumal N.","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"atypb21","first-page":"2757","volume":"29","author":"Boumal N.","year":"2016","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb22","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.laa.2005.07.021","volume":"415","author":"Brand M.","year":"2006","journal-title":"Linear Algebra Appl."},{"key":"atypb23","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s10589-017-9968-8","volume":"69","author":"Bravo Ferreira J. F. S.","year":"2018","journal-title":"Comput. Optim. Appl."},{"key":"atypb24","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"Burer S.","year":"2003","journal-title":"Math. Program."},{"key":"atypb25","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"Burer S.","year":"2005","journal-title":"Math. Program."},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/040609574"},{"key":"atypb27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"Burkard R. E.","year":"1997","journal-title":"J. Global Optim."},{"key":"atypb28","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.acha.2014.09.004","volume":"39","author":"Cand\u00e8s E. J.","year":"2015","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"atypb29","first-page":"589","volume":"99","author":"Carmon Y.","year":"2019","journal-title":"PMLR"},{"key":"atypb30","doi-asserted-by":"crossref","first-page":"015005","DOI":"10.1088\/0266-5611\/27\/1\/015005","volume":"27","author":"Chai A.","year":"2010","journal-title":"Inverse Problems"},{"key":"atypb31","unstructured":"D. Cifuentes,\n                      Burer-Monteiro Guarantees for General Semidefinite Programs\n                      ,https:\/\/arxiv.org\/abs\/1904.07147, 2019."},{"key":"atypb32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1824777.1824783","volume":"6","author":"Clarkson K. L.","year":"2010","journal-title":"ACM Trans. Algorithms"},{"key":"atypb34","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"Delorme C.","year":"1993","journal-title":"Math. Programming"},{"key":"atypb35","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(93)90151-I","volume":"111","author":"Delorme C.","year":"1993","journal-title":"Discrete Math."},{"key":"atypb36","unstructured":"L. Ding, A. Yurtsever, V. Cevher, J. A. Tropp, and M. Udell,\n                      An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity\n                      ,https:\/\/arxiv.org\/abs\/1902.03373, 2019."},{"key":"atypb37","unstructured":"M. Fazel,\n                      Matrix Rank Minimization with Applications\n                      , Ph.D. thesis, Stanford University, Palo Alto, CA, 2002."},{"key":"atypb38","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1364\/AO.21.002758","volume":"21","author":"Fienup J. R.","year":"1982","journal-title":"Appl. Optics"},{"key":"atypb39","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"Frank M.","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"atypb40","first-page":"25","author":"Garber D.","year":"2011","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb41","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-015-0932-z","volume":"158","author":"Garber D.","year":"2016","journal-title":"Math. Programming"},{"key":"atypb42","first-page":"1456","volume":"84","author":"Gidel G.","year":"2018","journal-title":"PMLR"},{"key":"atypb43","unstructured":"A. Gittens,\n                      Topics in Randomized Numerical Linear Algebra\n                      , Ph.D. thesis, California Institute of Technology, Pasadena, 2013."},{"key":"atypb44","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"Goemans M. X.","year":"1995","journal-title":"J. ACM"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"atypb46","first-page":"306","author":"Hazan E.","year":"2008","journal-title":"Theoretical Informatics"},{"key":"atypb47","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jpdc.1997.1381","volume":"46","author":"Homer S.","year":"1997","journal-title":"J. Parallel Distrib. Comput."},{"key":"atypb48","doi-asserted-by":"crossref","first-page":"053044","DOI":"10.1088\/1367-2630\/17\/5\/053044","volume":"17","author":"Horstmeyer R.","year":"2015","journal-title":"New J. Phys."},{"key":"atypb49","first-page":"64","volume":"32","author":"Huang Q.","year":"2014","journal-title":"PMLR"},{"key":"atypb50","first-page":"427","volume":"28","author":"Jaggi M.","year":"2013","journal-title":"PMLR"},{"key":"atypb51","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"Jones L. K.","year":"1992","journal-title":"Ann. Statist."},{"key":"atypb52","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"Jonker R.","year":"1987","journal-title":"Computing"},{"key":"atypb53","first-page":"229","volume":"2","author":"Kamath A. P.","year":"1991","journal-title":"J. Global Optim."},{"key":"atypb54","first-page":"254","author":"Kamath A. P.","year":"1993","journal-title":"NJ"},{"key":"atypb55","first-page":"85","author":"Karp R. M.","year":"1972","journal-title":"New York"},{"key":"atypb56","unstructured":"K. Krishnan and T. Terlaky,\n                      Interior point and semidefinite approaches in combinatorial optimization\n                      , in Graph Theory and Combinatorial Optimization, Springer, New York, 2005."},{"key":"atypb57","doi-asserted-by":"publisher","DOI":"10.1137\/0613066"},{"key":"atypb58","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"Kuhn H.","year":"1955","journal-title":"Naval Res. Logist. Quart."},{"key":"atypb59","first-page":"235","author":"Kulis B.","year":"2007","journal-title":"Puerto Rico"},{"key":"atypb60","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TPWRS.2011.2160974","volume":"27","author":"Lavaei J.","year":"2012","journal-title":"IEEE Trans. Power Syst."},{"key":"atypb61","first-page":"3069","author":"Lee Y. T.","year":"2020","journal-title":"Proceedings of the Conference on Learning Theory"},{"key":"atypb62","doi-asserted-by":"crossref","unstructured":"R. B. Lehoucq, D. C. Sorensen, and C. Yang,\n                      ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods\n                      , Software Environ. Tools 6, SIAM, Philadelphia, 1998.","DOI":"10.1137\/1.9780898719628"},{"key":"atypb63","first-page":"787","volume":"6","author":"Levitin E. S.","year":"1966","journal-title":"\u017d. Vy\u010disl. Mat. Mat. Fiz."},{"key":"atypb64","first-page":"28","volume":"43","author":"Li H.","year":"2017","journal-title":"ACM Trans. Math. Software"},{"key":"atypb65","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/moor.2018.0939","volume":"44","author":"Liu Y.-F.","year":"2019","journal-title":"Math. Oper. Res."},{"key":"atypb66","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"Loiola E. M.","year":"2007","journal-title":"European J. Oper. Res."},{"key":"atypb67","unstructured":"A. Majumdar, G. Hall, and A. A. Ahmadi,\n                      A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications to Machine Learning, Control, and Robotics\n                      ,http:\/\/arXiv.org\/abs\/1908.05209, 2019."},{"key":"atypb68","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/9.554402","volume":"42","author":"Mesbahi M.","year":"1997","journal-title":"IEEE Trans. Automat. Control"},{"key":"atypb69","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1093\/qmath\/11.1.50","volume":"11","author":"Mirsky L.","year":"1960","journal-title":"Quart. J. Math. Oxford Ser. (2)"},{"key":"atypb70","unstructured":"The MOSEK Optimization Toolbox for MATLAB Manual. Version\n                      9.0, Mosek ApS, 2019."},{"key":"atypb71","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"atypb72","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"atypb73","doi-asserted-by":"crossref","unstructured":"Y. Nesterov,\n                      Introductory Lectures on Convex Optimization: A Basic Course\n                      , Springer, New York, 2004.","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"atypb74","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Nesterov Y.","year":"2009","journal-title":"Math. Program."},{"key":"atypb75","unstructured":"Y. Nesterov and A. Nemirovski,\n                      Self-Concordant Functions and Polynomial Time Methods in Convex Programming\n                      , Central Economic & Mathematic Institute report, USSR Academy of Sciences, 1990."},{"key":"atypb76","doi-asserted-by":"crossref","unstructured":"Y. Nesterov and A. Nemirovski,\n                      Interior-Point Polynomial Algorithms in Convex Programming\n                      , SIAM, Philadelphia, 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"atypb77","doi-asserted-by":"crossref","unstructured":"B. N. Parlett,\n                      The symmetric eigenvalue problem\n                      , Classics in Appl. Math. 20, SIAM, Philadelphia, 1998,https:\/\/doi.org\/10.1137\/1.9781611971163.","DOI":"10.1137\/1.9781611971163"},{"key":"atypb78","unstructured":"P. Parrilo,\n                      Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization\n                      , Ph.D. thesis, California Institute of Technology, Pasadena, 2000."},{"key":"atypb79","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"Pataki G.","year":"1998","journal-title":"Math. Oper. Res."},{"key":"atypb80","first-page":"101","author":"Peng R.","year":"2012","journal-title":"Algorithms and Architectures"},{"key":"atypb81","first-page":"2281","volume":"31","author":"Pumir T.","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb82","first-page":"10900","volume":"31","author":"Raghunathan A.","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb84","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1177\/0278364918784361","volume":"38","author":"Rosen D. M.","year":"2019","journal-title":"Int. J. Robot. Res."},{"key":"atypb85","first-page":"13965","volume":"32","author":"Sahin M. F.","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb86","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"Sahni S.","year":"1976","journal-title":"J. ACM"},{"key":"atypb87","unstructured":"A. Silveti-Falls, C. Molinari, and J. Fadili,\n                      Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization\n                      ,https:\/\/arxiv.org\/abs\/1901.01287, 2019."},{"key":"atypb88","unstructured":"M. Souto, J. D. Garcia, and A. Veiga,\n                      Exploiting Low-Rank Structure in Semidefinite Programming by Approximate Operator Splitting\n                      ,https:\/\/arxiv.org\/abs\/1810.05231, 2018."},{"key":"atypb89","unstructured":"N. Srebro,\n                      Learning with Matrix Factorizations\n                      , Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, 2004."},{"key":"atypb90","doi-asserted-by":"crossref","unstructured":"J. Sturm,\n                      Using SeDuMi1.02, a MATLAB toolbox for optimization over symmetric cones\n                      , Optim. Methods Softw., 11-12 (1999), pp. 625-653.","DOI":"10.1080\/10556789908805766"},{"key":"atypb91","unstructured":"Y. Sun, Y. Guo, J. A. Tropp, and M. Udell,\n                      Tensor random projection for low memory dimension reduction\n                      , in NeurIPS Workshop on Relational Representation Learning, 2018."},{"key":"atypb92","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"Toh K. A.","year":"1999","journal-title":"Optim. Methods Softw."},{"key":"atypb93","first-page":"1225","volume":"30","author":"Tropp J. A.","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb94","doi-asserted-by":"publisher","DOI":"10.1137\/17M1111590"},{"key":"atypb95","doi-asserted-by":"publisher","DOI":"10.1137\/18M1201068"},{"key":"atypb96","first-page":"995","volume":"6","author":"Tsuda K.","year":"2005","journal-title":"J. Mach. Learn. Res."},{"key":"atypb97","unstructured":"I. Waldspurger and A. Waters,\n                      Rank optimality for the Burer-Monteiro factorization\n                      ,https:\/\/arxiv.org\/abs\/1812.03046, 2018."},{"key":"atypb98","unstructured":"Z. Wen, D. Goldfarb, S. Ma, and K. Scheinberg,\n                      Row by Row Methods for Semidefinite Programming\n                      , IEOR report, Columbia University, 2009."},{"key":"atypb99","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Wen Z.","year":"2010","journal-title":"Math. Program. Comput."},{"key":"atypb100","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"Yang L.","year":"2015","journal-title":"Math. Progam. Comput."},{"key":"atypb102","first-page":"7272","volume":"97","author":"Yurtsever A.","year":"2019","journal-title":"PMLR"},{"key":"atypb103","first-page":"5727","volume":"80","author":"Yurtsever A.","year":"2018","journal-title":"PMLR"},{"key":"atypb104","first-page":"381","author":"Yurtsever A.","year":"2015","journal-title":"Multi-Sensor Adaptive Processing"},{"key":"atypb105","first-page":"3150","volume":"28","author":"Yurtsever A.","year":"2015","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb106","first-page":"1188","volume":"54","author":"Yurtsever A.","year":"2017","journal-title":"PMLR"},{"key":"atypb107","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"Zaslavskiy M.","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"atypb108","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Zhao Q.","year":"1998","journal-title":"J. Combin. Optim."},{"key":"atypb109","doi-asserted-by":"publisher","DOI":"10.1137\/080718206"},{"key":"atypb110","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1038\/nphoton.2013.187","volume":"7","author":"Zheng G.","year":"2013","journal-title":"Nat. Photonics"}],"container-title":["SIAM Journal on Mathematics of Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/19M1305045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:48:43Z","timestamp":1787327323000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/19M1305045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":107,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1137\/19M1305045"],"URL":"https:\/\/doi.org\/10.1137\/19m1305045","relation":{},"ISSN":["2577-0187"],"issn-type":[{"value":"2577-0187","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}