{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:51:10Z","timestamp":1776955870920,"version":"3.51.4"},"reference-count":133,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10208-019-09429-9","type":"journal-article","created":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T21:02:33Z","timestamp":1565038953000},"page":"451-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":97,"title":["Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution"],"prefix":"10.1007","volume":"20","author":[{"given":"Cong","family":"Ma","sequence":"first","affiliation":[]},{"given":"Kaizheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"9429_CR1","unstructured":"Abbe, E., Fan, J., Wang, K., Zhong, Y.: Entrywise eigenvector analysis of random matrices with low expected rank. arXiv preprint arXiv:1709.09565 (2017)"},{"key":"9429_CR2","doi-asserted-by":"crossref","unstructured":"Aghasi, A., Ahmed, A., Hand, P., Joshi, B.: Branchhull: Convex bilinear inversion from the entrywise product of signals with known signs. Applied and Computational Harmonic Analysis (2019)","DOI":"10.1016\/j.acha.2019.03.002"},{"issue":"3","key":"9429_CR3","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/TIT.2013.2294644","volume":"60","author":"A Ahmed","year":"2014","unstructured":"Ahmed, A., Recht, B., Romberg, J.: Blind deconvolution using convex programming. IEEE Transactions on Information Theory 60(3), 1711\u20131732 (2014)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9429_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method (3rd Edition). Wiley (2008)","DOI":"10.1002\/9780470277331"},{"key":"9429_CR5","doi-asserted-by":"crossref","unstructured":"Bahmani, S., Romberg, J.: Phase retrieval meets statistical learning theory: A flexible convex relaxation. In: Artificial Intelligence and Statistics, pp. 252\u2013260 (2017)","DOI":"10.1214\/17-EJS1378SI"},{"key":"9429_CR6","doi-asserted-by":"crossref","unstructured":"Bendory, T., Eldar, Y.C., Boumal, N.: Non-convex phase retrieval from STFT measurements. IEEE Transactions on Information Theory (2017)","DOI":"10.1109\/ICASSP.2017.7953062"},{"key":"9429_CR7","unstructured":"Bhojanapalli, S., Neyshabur, B., Srebro, N.: Global optimality of local search for low rank matrix recovery. In: Advances in Neural Information Processing Systems, pp. 3873\u20133881 (2016)"},{"issue":"Mar","key":"9429_CR8","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., Elisseeff, A.: Stability and generalization. Journal of Machine Learning Research 2(Mar), 499\u2013526 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"9429_CR9","doi-asserted-by":"crossref","unstructured":"Bubeck, S.: Convex optimization: Algorithms and complexity. Foundations and Trends$${\\textregistered }$$ in Machine Learning 8(3-4), 231\u2013357 (2015)","DOI":"10.1561\/2200000050"},{"issue":"1","key":"9429_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/s10915-018-0857-9","volume":"79","author":"JF Cai","year":"2019","unstructured":"Cai, J.F., Liu, H., Wang, Y.: Fast rank-one alternating minimization algorithm for phase retrieval. Journal of Scientific Computing 79(1), 128\u2013147 (2019)","journal-title":"Journal of Scientific Computing"},{"issue":"1","key":"9429_CR11","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1214\/14-AOS1267","volume":"43","author":"T Cai","year":"2015","unstructured":"Cai, T., Zhang, A.: ROP: Matrix recovery via rank-one projections. The Annals of Statistics 43(1), 102\u2013138 (2015)","journal-title":"The Annals of Statistics"},{"issue":"5","key":"9429_CR12","doi-asserted-by":"crossref","first-page":"2221","DOI":"10.1214\/16-AOS1443","volume":"44","author":"TT Cai","year":"2016","unstructured":"Cai, T.T., Li, X., Ma, Z.: Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow. The Annals of Statistics 44(5), 2221\u20132251 (2016)","journal-title":"The Annals of Statistics"},{"issue":"11","key":"9429_CR13","doi-asserted-by":"publisher","first-page":"7235","DOI":"10.1109\/TIT.2011.2161794","volume":"57","author":"E Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E., Plan, Y.: A probabilistic and RIPless theory of compressed sensing. IEEE Transactions on Information Theory 57(11), 7235\u20137254 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2161794","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"9429_CR14","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory 56(5), 2053 \u20132080 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"9429_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/110848074","volume":"6","author":"EJ Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s, E.J., Eldar, Y.C., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. SIAM Journal on Imaging Sciences 6(1), 199\u2013225 (2013)","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"5","key":"9429_CR16","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s10208-013-9162-z","volume":"14","author":"EJ Cand\u00e8s","year":"2014","unstructured":"Cand\u00e8s, E.J., Li, X.: Solving quadratic equations via PhaseLift when there are about as many equations as unknowns. Foundations of Computational Mathematics 14(5), 1017\u20131026 (2014)","journal-title":"Foundations of Computational Mathematics"},{"issue":"3","key":"9429_CR17","doi-asserted-by":"crossref","first-page":"11:1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? Journal of ACM 58(3), 11:1\u201311:37 (2011)","journal-title":"Journal of ACM"},{"issue":"4","key":"9429_CR18","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"EJ Cand\u00e8s","year":"2015","unstructured":"Cand\u00e8s, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via Wirtinger flow: Theory and algorithms. IEEE Transactions on Information Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"9429_CR19","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6), 717\u2013772 (2009)","journal-title":"Foundations of Computational Mathematics"},{"issue":"8","key":"9429_CR20","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1002\/cpa.21432","volume":"66","author":"EJ Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s, E.J., Strohmer, T., Voroninski, V.: Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Communications on Pure and Applied Mathematics 66(8), 1017\u20131026 (2013)","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"2","key":"9429_CR21","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization 21(2), 572\u2013596 (2011)","journal-title":"SIAM Journal on Optimization"},{"key":"9429_CR22","unstructured":"Chen, P., Fannjiang, A., Liu, G.R.: Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization. Journal of Fourier Analysis and Applications, pp. 1\u201340 (2015)"},{"issue":"5","key":"9429_CR23","doi-asserted-by":"crossref","first-page":"2909","DOI":"10.1109\/TIT.2015.2415195","volume":"61","author":"Y Chen","year":"2015","unstructured":"Chen, Y.: Incoherence-optimal matrix completion. IEEE Transactions on Information Theory 61(5), 2909\u20132923 (2015)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"9429_CR24","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1002\/cpa.21760","volume":"71","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Cand\u00e8s, E.: The projected power method: An efficient algorithm for joint alignment from pairwise differences. Communications on Pure and Applied Mathematics 71(8), 1648\u20131714 (2018)","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"5","key":"9429_CR25","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1002\/cpa.21638","volume":"70","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Cand\u00e8s, E.J.: Solving random quadratic systems of equations is nearly as easy as solving linear systems. Communications on Pure and Applied Mathematics 70(5), 822\u2013883 (2017). https:\/\/doi.org\/10.1002\/cpa.21638 .","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"9429_CR26","unstructured":"Chen, Y., Cheng, C., Fan, J.: Asymmetry helps: Eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices. arXiv preprint arXiv:1811.12804 (2018)"},{"issue":"1\u20132","key":"9429_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-019-01363-6","volume":"176","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Chi, Y., Fan, J., Ma, C.: Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval. Mathematical Programming 176(1-2), 5\u201337 (2019)","journal-title":"Mathematical Programming"},{"key":"9429_CR28","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chi, Y., Fan, J., Ma, C., Yan, Y.: Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization. arXiv preprint arXiv:1902.07698 (2019)","DOI":"10.1137\/19M1290000"},{"issue":"7","key":"9429_CR29","doi-asserted-by":"crossref","first-page":"4034","DOI":"10.1109\/TIT.2015.2429594","volume":"61","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Chi, Y., Goldsmith, A.J.: Exact and stable covariance estimation from quadratic sampling via convex programming. IEEE Transactions on Information Theory 61(7), 4034\u20134059 (2015)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9429_CR30","doi-asserted-by":"crossref","first-page":"2204","DOI":"10.1214\/18-AOS1745","volume":"47","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Fan, J., Ma, C., Wang, K.: Spectral method and regularized MLE are both optimal for top-$$K$$ ranking. Annals of Statistics 47(4), 2204\u20132235 (2019)","journal-title":"Annals of Statistics"},{"key":"9429_CR31","doi-asserted-by":"crossref","unstructured":"Chen, Y., Fan, J., Ma, C., Yan, Y.: Inference and uncertainty quantification for noisy matrix completion. arXiv preprint arXiv:1906.04159 (2019)","DOI":"10.1073\/pnas.1910053116"},{"key":"9429_CR32","unstructured":"Chen, Y., Wainwright, M.J.: Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees. arXiv preprint arXiv:1509.03025 (2015)"},{"key":"9429_CR33","unstructured":"Chen, Y., Yi, X., Caramanis, C.: A convex formulation for mixed regression with two components: Minimax optimal rates. In: Conference on Learning Theory, pp. 560\u2013604 (2014)"},{"key":"9429_CR34","unstructured":"Cherapanamjeri, Y., Jain, P., Netrapalli, P.: Thresholding based outlier robust PCA. In: Conference on Learning Theory, pp. 593\u2013628 (2017)"},{"issue":"4","key":"9429_CR35","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/JSTSP.2016.2543462","volume":"10","author":"Y Chi","year":"2016","unstructured":"Chi, Y.: Guaranteed blind sparse spikes deconvolution via lifting and convex optimization. IEEE Journal of Selected Topics in Signal Processing 10(4), 782\u2013794 (2016)","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"9","key":"9429_CR36","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/LSP.2016.2590468","volume":"23","author":"Y Chi","year":"2016","unstructured":"Chi, Y., Lu, Y.M.: Kaczmarz method for solving quadratic equations. IEEE Signal Processing Letters 23(9), 1183\u20131187 (2016)","journal-title":"IEEE Signal Processing Letters"},{"key":"9429_CR37","doi-asserted-by":"crossref","unstructured":"Chi, Y., Lu, Y.M., Chen, Y.: Nonconvex optimization meets low-rank matrix factorization: An overview. arXiv preprint arXiv:1809.09573 (2018)","DOI":"10.1109\/TSP.2019.2937282"},{"issue":"4","key":"9429_CR38","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/JSTSP.2016.2539100","volume":"10","author":"MA Davenport","year":"2016","unstructured":"Davenport, M.A., Romberg, J.: An overview of low-rank matrix recovery from incomplete observations. IEEE Journal of Selected Topics in Signal Processing 10(4), 608\u2013622 (2016)","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"1","key":"9429_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0707001","volume":"7","author":"C Davis","year":"1970","unstructured":"Davis, C., Kahan, W.M.: The rotation of eigenvectors by a perturbation. iii. SIAM Journal on Numerical Analysis 7(1), 1\u201346 (1970)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"9429_CR40","unstructured":"Davis, D., Drusvyatskiy, D., Paquette, C.: The nonsmooth landscape of phase retrieval. arXiv preprint arXiv:1711.03247 (2017)"},{"key":"9429_CR41","doi-asserted-by":"crossref","unstructured":"Dhifallah, O., Thrampoulidis, C., Lu, Y.M.: Phase retrieval via linear programming: Fundamental limits and algorithmic improvements. arXiv preprint arXiv:1710.05234 (2017)","DOI":"10.1109\/ALLERTON.2017.8262856"},{"issue":"2","key":"9429_CR42","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1023\/A:1022303426500","volume":"40","author":"FM Dopico","year":"2000","unstructured":"Dopico, F.M.: A note on $$\\sin \\Theta $$ theorems for singular subspace variations. BIT 40(2), 395\u2013403 (2000). https:\/\/doi.org\/10.1023\/A:1022303426500 .","journal-title":"BIT"},{"key":"9429_CR43","doi-asserted-by":"crossref","unstructured":"Duchi, J.C., Ruan, F.: Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval. Information and Inference (2018)","DOI":"10.1093\/imaiai\/iay015"},{"key":"9429_CR44","unstructured":"El\u00a0Karoui, N.: On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators. Probability Theory and Related Fields pp. 1\u201381 (2015)"},{"issue":"36","key":"9429_CR45","doi-asserted-by":"crossref","first-page":"14557","DOI":"10.1073\/pnas.1307842110","volume":"110","author":"N El Karoui","year":"2013","unstructured":"El\u00a0Karoui, N., Bean, D., Bickel, P.J., Lim, C., Yu, B.: On robust regression with high-dimensional predictors. Proceedings of the National Academy of Sciences 110(36), 14557\u201314562 (2013)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"9429_CR46","unstructured":"Fan, J., Ma, C., Zhong, Y.: A selective overview of deep learning. arXiv preprint arXiv:1904.05526 (2019)"},{"key":"9429_CR47","unstructured":"Gao, B., Xu, Z.: Phase retrieval using Gauss-Newton method. arXiv preprint arXiv:1606.08135 (2016)"},{"key":"9429_CR48","unstructured":"Ge, R., Lee, J.D., Ma, T.: Matrix completion has no spurious local minimum. In: Advances in Neural Information Processing Systems, pp. 2973\u20132981 (2016)"},{"key":"9429_CR49","unstructured":"Ge, R., Ma, T.: On the optimization landscape of tensor decompositions. In: Advances in Neural Information Processing Systems, pp. 3653\u20133663 (2017)"},{"issue":"4","key":"9429_CR50","doi-asserted-by":"crossref","first-page":"2675","DOI":"10.1109\/TIT.2018.2800768","volume":"64","author":"T Goldstein","year":"2018","unstructured":"Goldstein, T., Studer, C.: Phasemax: Convex phase retrieval via basis pursuit. IEEE Transactions on Information Theory 64(4), 2675\u20132689 (2018)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"9429_CR51","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory 57(3), 1548\u20131566 (2011)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9429_CR52","doi-asserted-by":"crossref","unstructured":"Gunasekar, S., Woodworth, B.E., Bhojanapalli, S., Neyshabur, B., Srebro, N.: Implicit regularization in matrix factorization. In: Advances in Neural Information Processing Systems, pp. 6151\u20136159 (2017)","DOI":"10.1109\/ITA.2018.8503198"},{"issue":"7","key":"9429_CR53","doi-asserted-by":"crossref","first-page":"2047","DOI":"10.4310\/CMS.2018.v16.n7.a13","volume":"16","author":"P Hand","year":"2018","unstructured":"Hand, P., Voroninski, V.: An elementary proof of convex phase retrieval in the natural parameter space via the linear program phasemax. Communications in Mathematical Sciences 16(7), 2047\u20132051 (2018)","journal-title":"Communications in Mathematical Sciences"},{"key":"9429_CR54","unstructured":"Hardt, M., Wootters, M.: Fast matrix completion without the condition number. Conference on Learning Theory, pp. 638\u2013678 (2014)"},{"key":"9429_CR55","first-page":"3367","volume":"16","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Mazumder, R., Lee, J.D., Zadeh, R.: Matrix completion and low-rank SVD via fast alternating least squares. Journal of Machine Learning Research 16, 3367\u20133402 (2015)","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"9429_CR56","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/BF01396242","volume":"62","author":"NJ Higham","year":"1992","unstructured":"Higham, N.J.: Estimating the matrix $$p$$-norm. Numerische Mathematik 62(1), 539\u2013555 (1992)","journal-title":"Numerische Mathematik"},{"issue":"52","key":"9429_CR57","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1214\/ECP.v17-2079","volume":"17","author":"D Hsu","year":"2012","unstructured":"Hsu, D., Kakade, S.M., Zhang, T.: A tail inequality for quadratic forms of subgaussian random vectors. Electron. Commun. Probab. 17, no. 52, 6 (2012). https:\/\/doi.org\/10.1214\/ECP.v17-2079 .","journal-title":"Electron. Commun. Probab."},{"issue":"4","key":"9429_CR58","doi-asserted-by":"crossref","first-page":"2757","DOI":"10.1137\/17M1151390","volume":"11","author":"W Huang","year":"2018","unstructured":"Huang, W., Hand, P.: Blind deconvolution by a steepest descent algorithm on a quotient manifold. SIAM Journal on Imaging Sciences 11(4), 2757\u20132785 (2018)","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"9429_CR59","unstructured":"Jaganathan, K., Eldar, Y.C., Hassibi, B.: Phase retrieval: An overview of recent developments. arXiv preprint arXiv:1510.07713 (2015)"},{"key":"9429_CR60","unstructured":"Jain, P., Netrapalli, P.: Fast exact matrix completion with finite samples. In: Conference on Learning Theory, pp. 1007\u20131034 (2015)"},{"key":"9429_CR61","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: ACM symposium on Theory of computing, pp. 665\u2013674 (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"6A","key":"9429_CR62","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1214\/17-AOS1630","volume":"46","author":"A Javanmard","year":"2018","unstructured":"Javanmard, A., Montanari, A., et\u00a0al.: Debiasing the lasso: Optimal sample size for gaussian designs. The Annals of Statistics 46(6A), 2593\u20132622 (2018)","journal-title":"The Annals of Statistics"},{"key":"9429_CR63","unstructured":"Jin, C., Kakade, S.M., Netrapalli, P.: Provable efficient online matrix completion via non-convex stochastic gradient descent. In: Advances in Neural Information Processing Systems, pp. 4520\u20134528 (2016)"},{"issue":"6","key":"9429_CR64","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Transactions on Information Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9429_CR65","first-page":"2057","volume":"11","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from noisy entries. J. Mach. Learn. Res. 11, 2057\u20132078 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"9429_CR66","doi-asserted-by":"publisher","unstructured":"Koltchinskii, V.: Oracle inequalities in empirical risk minimization and sparse recovery problems, Lecture Notes in Mathematics, vol. 2033. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22147-7","DOI":"10.1007\/978-3-642-22147-7"},{"issue":"5","key":"9429_CR67","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V., Lounici, K., Tsybakov, A.B.: Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Statist. 39(5), 2302\u20132329 (2011). https:\/\/doi.org\/10.1214\/11-AOS894 .","journal-title":"Ann. Statist."},{"key":"9429_CR68","unstructured":"Kolte, R., \u00d6zg\u00fcr, A.: Phase retrieval via incremental truncated Wirtinger flow. arXiv preprint arXiv:1606.03196 (2016)"},{"key":"9429_CR69","unstructured":"Kreutz-Delgado, K.: The complex gradient operator and the CR-calculus. arXiv preprint arXiv:0906.4835 (2009)"},{"key":"9429_CR70","doi-asserted-by":"crossref","unstructured":"Lang, S.: Real and functional analysis. Springer-Verlag, New York, 10, 11\u201313 (1993)","DOI":"10.1007\/978-1-4612-0897-6"},{"issue":"9","key":"9429_CR71","doi-asserted-by":"crossref","first-page":"4402","DOI":"10.1109\/TIT.2010.2054251","volume":"56","author":"K Lee","year":"2010","unstructured":"Lee, K., Bresler, Y.: Admira: Atomic decomposition for minimum rank approximation. IEEE Transactions on Information Theory 56(9), 4402\u20134416 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"9429_CR72","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1109\/TIT.2016.2636204","volume":"63","author":"K Lee","year":"2017","unstructured":"Lee, K., Li, Y., Junge, M., Bresler, Y.: Blind recovery of sparse signals from subsampled convolution. IEEE Transactions on Information Theory 63(2), 802\u2013821 (2017)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"9429_CR73","doi-asserted-by":"crossref","first-page":"4792","DOI":"10.1109\/TIT.2018.2840711","volume":"64","author":"K Lee","year":"2018","unstructured":"Lee, K., Tian, N., Romberg, J.: Fast and guaranteed blind multichannel deconvolution under a bilinear system model. IEEE Transactions on Information Theory 64(7), 4792\u20134818 (2018)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"9429_CR74","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1093\/imaiai\/iax012","volume":"7","author":"G Lerman","year":"2017","unstructured":"Lerman, G., Maunu, T.: Fast, robust and non-convex subspace recovery. Information and Inference: A Journal of the IMA 7(2), 277\u2013336 (2017)","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"9429_CR75","doi-asserted-by":"crossref","unstructured":"Li, Q., Tang, G.: The nonconvex geometry of low-rank matrix optimizations with general objective functions. In: 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 1235\u20131239. IEEE (2017)","DOI":"10.1109\/GlobalSIP.2017.8309158"},{"key":"9429_CR76","doi-asserted-by":"crossref","unstructured":"Li, X., Ling, S., Strohmer, T., Wei, K.: Rapid, robust, and reliable blind deconvolution via nonconvex optimization. Applied and computational harmonic analysis (2018)","DOI":"10.1016\/j.acha.2018.01.001"},{"key":"9429_CR77","unstructured":"Li, X., Wang, Z., Lu, J., Arora, R., Haupt, J., Liu, H., Zhao, T.: Symmetry, saddle points, and global geometry of nonconvex matrix factorization. arXiv preprint arXiv:1612.09296 (2016)"},{"key":"9429_CR78","doi-asserted-by":"crossref","unstructured":"Li, Y., Lee, K., Bresler, Y.: Blind gain and phase calibration for low-dimensional or sparse signal sensing via power iteration. In: Sampling Theory and Applications (SampTA), 2017 International Conference on, pp. 119\u2013123. IEEE (2017)","DOI":"10.1109\/SAMPTA.2017.8024422"},{"key":"9429_CR79","unstructured":"Li, Y., Ma, C., Chen, Y., Chi, Y.: Nonconvex matrix factorization from rank-one measurements. arXiv preprint arXiv:1802.06286 (2018)"},{"key":"9429_CR80","unstructured":"Lin, J., Camoriano, R., Rosasco, L.: Generalization properties and implicit regularization for multiple passes SGM. In: International Conference on Machine Learning, pp. 2340\u20132348 (2016)"},{"issue":"11","key":"9429_CR81","doi-asserted-by":"crossref","first-page":"115002","DOI":"10.1088\/0266-5611\/31\/11\/115002","volume":"31","author":"S Ling","year":"2015","unstructured":"Ling, S., Strohmer, T.: Self-calibration and biconvex compressive sensing. Inverse Problems 31(11), 115002 (2015)","journal-title":"Inverse Problems"},{"issue":"1","key":"9429_CR82","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imaiai\/iax022","volume":"8","author":"S Ling","year":"2018","unstructured":"Ling, S., Strohmer, T.: Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing. Information and Inference: A Journal of the IMA 8(1), 1\u201349 (2018)","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"9429_CR83","unstructured":"Lu, Y.M., Li, G.: Phase transitions of spectral initialization for high-dimensional nonconvex estimation. arXiv preprint arXiv:1702.06435 (2017)"},{"key":"9429_CR84","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0024-3795(90)90403-Y","volume":"139","author":"R Mathias","year":"1990","unstructured":"Mathias, R.: The spectral norm of a nonnegative matrix. Linear Algebra Appl. 139, 269\u2013284 (1990). https:\/\/doi.org\/10.1016\/0024-3795(90)90403-Y .","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"9429_CR85","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1137\/0614041","volume":"14","author":"R Mathias","year":"1993","unstructured":"Mathias, R.: Perturbation bounds for the polar decomposition. SIAM Journal on Matrix Analysis and Applications 14(2), 588\u2013597 (1993)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"37","key":"9429_CR86","first-page":"1","volume":"20","author":"T Maunu","year":"2019","unstructured":"Maunu, T., Zhang, T., Lerman, G.: A well-tempered landscape for non-convex robust subspace recovery. Journal of Machine Learning Research 20(37), 1\u201359 (2019)","journal-title":"Journal of Machine Learning Research"},{"issue":"6A","key":"9429_CR87","doi-asserted-by":"crossref","first-page":"2747","DOI":"10.1214\/17-AOS1637","volume":"46","author":"S Mei","year":"2018","unstructured":"Mei, S., Bai, Y., Montanari, A.: The landscape of empirical risk for nonconvex losses. The Annals of Statistics 46(6A), 2747\u20132774 (2018)","journal-title":"The Annals of Statistics"},{"key":"9429_CR88","unstructured":"Mondelli, M., Montanari, A.: Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics, pp. 1\u201371 (2017)"},{"key":"9429_CR89","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., Wainwright, M.J.: Restricted strong convexity and weighted matrix completion: optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9429_CR90","unstructured":"Netrapalli, P., Jain, P., Sanghavi, S.: Phase retrieval using alternating minimization. Advances in Neural Information Processing Systems (NIPS) (2013)"},{"key":"9429_CR91","unstructured":"Netrapalli, P., Niranjan, U., Sanghavi, S., Anandkumar, A., Jain, P.: Non-convex robust PCA. In: Advances in Neural Information Processing Systems, pp. 1107\u20131115 (2014)"},{"key":"9429_CR92","unstructured":"Qing, Q., Zhang, Y., Eldar, Y., Wright, J.: Convolutional phase retrieval via gradient descent. Neural Information Processing Systems (2017)"},{"issue":"Dec","key":"9429_CR93","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B.: A simpler approach to matrix completion. Journal of Machine Learning Research 12(Dec), 3413\u20133430 (2011)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"9429_CR94","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review 52(3), 471\u2013501 (2010)","journal-title":"SIAM Review"},{"key":"9429_CR95","doi-asserted-by":"crossref","unstructured":"Rudelson, M., Vershynin, R., et\u00a0al.: Hanson-Wright inequality and sub-Gaussian concentration. Electronic Communications in Probability 18 (2013)","DOI":"10.1214\/ECP.v18-2865"},{"issue":"3\u20134","key":"9429_CR96","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s00025-016-0564-5","volume":"71","author":"S Sanghavi","year":"2017","unstructured":"Sanghavi, S., Ward, R., White, C.D.: The local convexity of solving systems of quadratic equations. Results in Mathematics 71(3-4), 569\u2013608 (2017)","journal-title":"Results in Mathematics"},{"key":"9429_CR97","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0024-3795(92)90052-C","volume":"174","author":"BA Schmitt","year":"1992","unstructured":"Schmitt, B.A.: Perturbation bounds for matrix square roots and Pythagorean sums. Linear Algebra Appl. 174, 215\u2013227 (1992). https:\/\/doi.org\/10.1016\/0024-3795(92)90052-C .","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"9429_CR98","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1109\/TSP.2014.2386294","volume":"63","author":"P Schniter","year":"2015","unstructured":"Schniter, P., Rangan, S.: Compressive phase retrieval via generalized approximate message passing. IEEE Transactions on Signal Processing 63(4), 1043\u20131055 (2015)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"9429_CR99","doi-asserted-by":"crossref","unstructured":"Schudy, W., Sviridenko, M.: Concentration and moment inequalities for polynomials of independent random variables. In: Symposium on Discrete Algorithms, pp. 437\u2013446. ACM, New York (2012)","DOI":"10.1137\/1.9781611973099.37"},{"issue":"4","key":"9429_CR100","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1109\/TSP.2013.2297687","volume":"62","author":"Y Shechtman","year":"2014","unstructured":"Shechtman, Y., Beck, A., Eldar, Y.C.: GESPAR: Efficient phase retrieval of sparse signals. IEEE Transactions on Signal Processing 62(4), 928\u2013938 (2014)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"9429_CR101","unstructured":"Soltanolkotabi, M.: Algorithms and theory for clustering and nonconvex quadratic programming. Ph.D. thesis, Stanford University (2014)"},{"issue":"4","key":"9429_CR102","doi-asserted-by":"crossref","first-page":"2374","DOI":"10.1109\/TIT.2019.2891653","volume":"65","author":"M Soltanolkotabi","year":"2019","unstructured":"Soltanolkotabi, M.: Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization. IEEE Transactions on Information Theory 65(4), 2374\u20132400 (2019)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"9429_CR103","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TIT.2018.2854560","volume":"65","author":"M Soltanolkotabi","year":"2019","unstructured":"Soltanolkotabi, M., Javanmard, A., Lee, J.D.: Theoretical insights into the optimization landscape of over-parameterized shallow neural networks. IEEE Transactions on Information Theory 65(2), 742\u2013769 (2019)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"9429_CR104","first-page":"2822","volume":"19","author":"D Soudry","year":"2018","unstructured":"Soudry, D., Hoffer, E., Nacson, M.S., Gunasekar, S., Srebro, N.: The implicit bias of gradient descent on separable data. The Journal of Machine Learning Research 19(1), 2822\u20132878 (2018)","journal-title":"The Journal of Machine Learning Research"},{"key":"9429_CR105","doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, Q., Wright, J.: A geometric analysis of phase retrieval. In: Information Theory (ISIT), 2016 IEEE International Symposium on, pp. 2379\u20132383. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541725"},{"issue":"2","key":"9429_CR106","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1109\/TIT.2016.2632162","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere i: Overview and the geometric picture. IEEE Transactions on Information Theory 63(2), 853\u2013884 (2017)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"9429_CR107","doi-asserted-by":"crossref","first-page":"6535","DOI":"10.1109\/TIT.2016.2598574","volume":"62","author":"R Sun","year":"2016","unstructured":"Sun, R., Luo, Z.Q.: Guaranteed matrix completion via non-convex factorization. IEEE Transactions on Information Theory 62(11), 6535\u20136579 (2016)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9429_CR108","unstructured":"Sur, P., Chen, Y., Cand\u00e8s, E.J.: The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled chi-square. arXiv preprint arXiv:1706.01191 , accepted to Probability Theory and Related Fields (2017)"},{"issue":"1","key":"9429_CR109","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/imaiai\/iay005","volume":"8","author":"YS Tan","year":"2018","unstructured":"Tan, Y.S., Vershynin, R.: Phase retrieval via randomized kaczmarz: Theoretical guarantees. Information and Inference: A Journal of the IMA 8(1), 97\u2013123 (2018)","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"2","key":"9429_CR110","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.acha.2015.08.003","volume":"40","author":"J Tanner","year":"2016","unstructured":"Tanner, J., Wei, K.: Low rank matrix completion by alternating steepest descent methods. Applied and Computational Harmonic Analysis 40(2), 417\u2013429 (2016)","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"9429_CR111","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/132","volume-title":"Topics in Random Matrix Theory","author":"T Tao","year":"2012","unstructured":"Tao, T.: Topics in Random Matrix Theory. Graduate Studies in Mathematics. American Mathematical Society, Providence, Rhode Island (2012)"},{"issue":"2","key":"9429_CR112","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02294053","volume":"42","author":"JM Ten Berge","year":"1977","unstructured":"Ten\u00a0Berge, J.M.: Orthogonal procrustes rotation for two or more matrices. Psychometrika 42(2), 267\u2013276 (1977)","journal-title":"Psychometrika"},{"key":"9429_CR113","doi-asserted-by":"crossref","unstructured":"Tropp, J.A.: Convex recovery of a structured signal from independent random linear measurements. In: Sampling Theory, a Renaissance, pp. 67\u2013101. Springer (2015)","DOI":"10.1007\/978-3-319-19749-4_2"},{"issue":"1\u20132","key":"9429_CR114","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000048","volume":"8","author":"JA Tropp","year":"2015","unstructured":"Tropp, J.A.: An introduction to matrix concentration inequalities. Found. Trends Mach. Learn. 8(1-2), 1\u2013230 (2015). https:\/\/doi.org\/10.1561\/2200000048 .","journal-title":"Found. Trends Mach. Learn."},{"key":"9429_CR115","unstructured":"Tu, S., Boczar, R., Simchowitz, M., Soltanolkotabi, M., Recht, B.: Low-rank solutions of linear matrix equations via procrustes flow. In: International Conference on Machine Learning, pp. 964\u2013973. JMLR. org (2016)"},{"key":"9429_CR116","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. Compressed Sensing, Theory and Applications, pp. 210\u2013268 (2012)","DOI":"10.1017\/CBO9780511794308.006"},{"key":"9429_CR117","unstructured":"Wang, G., Giannakis, G., Saad, Y., Chen, J.: Solving most systems of random quadratic equations. In: Advances in Neural Information Processing Systems, pp. 1867\u20131877 (2017)"},{"key":"9429_CR118","doi-asserted-by":"crossref","unstructured":"Wang, G., Giannakis, G.B., Eldar, Y.C.: Solving systems of random quadratic equations via truncated amplitude flow. IEEE Transactions on Information Theory (2017)","DOI":"10.23919\/EUSIPCO.2017.8081443"},{"issue":"2","key":"9429_CR119","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1109\/TSP.2017.2771733","volume":"66","author":"G Wang","year":"2018","unstructured":"Wang, G., Zhang, L., Giannakis, G.B., Ak\u00e7akaya, M., Chen, J.: Sparse phase retrieval via truncated amplitude flow. IEEE Transactions on Signal Processing 66(2), 479\u2013491 (2018)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"10","key":"9429_CR120","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/LSP.2016.2599104","volume":"23","author":"L Wang","year":"2016","unstructured":"Wang, L., Chi, Y.: Blind deconvolution from multiple sparse inputs. IEEE Signal Processing Letters 23(10), 1384\u20131388 (2016)","journal-title":"IEEE Signal Processing Letters"},{"issue":"1","key":"9429_CR121","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01932678","volume":"12","author":"P\u00c5 Wedin","year":"1972","unstructured":"Wedin, P.\u00c5.: Perturbation bounds in connection with singular value decomposition. BIT Numerical Mathematics 12(1), 99\u2013111 (1972)","journal-title":"BIT Numerical Mathematics"},{"issue":"12","key":"9429_CR122","doi-asserted-by":"crossref","first-page":"125008","DOI":"10.1088\/0266-5611\/31\/12\/125008","volume":"31","author":"K Wei","year":"2015","unstructured":"Wei, K.: Solving systems of phaseless equations via Kaczmarz methods: A proof of concept study. Inverse Problems 31(12), 125008 (2015)","journal-title":"Inverse Problems"},{"issue":"3","key":"9429_CR123","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1137\/15M1050525","volume":"37","author":"K Wei","year":"2016","unstructured":"Wei, K., Cai, J.F., Chan, T.F., Leung, S.: Guarantees of riemannian optimization for low rank matrix recovery. SIAM Journal on Matrix Analysis and Applications 37(3), 1198\u20131222 (2016)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"9429_CR124","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1093\/biomet\/asv008","volume":"102","author":"Y Yu","year":"2015","unstructured":"Yu, Y., Wang, T., Samworth, R.J.: A useful variant of the Davis-Kahan theorem for statisticians. Biometrika 102(2), 315\u2013323 (2015). https:\/\/doi.org\/10.1093\/biomet\/asv008 .","journal-title":"Biometrika"},{"key":"9429_CR125","unstructured":"Zhang, C., Bengio, S., Hardt, M., Recht, B., Vinyals, O.: Understanding deep learning requires rethinking generalization. International Conference on Learning Representations (2017)"},{"key":"9429_CR126","unstructured":"Zhang, H., Chi, Y., Liang, Y.: Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow. In: International conference on machine learning, pp. 1022\u20131031 (2016)"},{"key":"9429_CR127","unstructured":"Zhang, H., Zhou, Y., Liang, Y., Chi, Y.: A nonconvex approach for phase retrieval: Reshaped wirtinger flow and incremental algorithms. Journal of Machine Learning Research (2017)"},{"key":"9429_CR128","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Lau, Y., Kuo, H.w., Cheung, S., Pasupathy, A., Wright, J.: On the global geometry of sphere-constrained sparse blind deconvolution. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4894\u20134902 (2017)","DOI":"10.1109\/CVPR.2017.466"},{"key":"9429_CR129","unstructured":"Zhao, T., Wang, Z., Liu, H.: A nonconvex optimization framework for low rank matrix estimation. In: Advances in Neural Information Processing Systems, pp. 559\u2013567 (2015)"},{"key":"9429_CR130","unstructured":"Zheng, Q., Lafferty, J.: A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements. In: Advances in Neural Information Processing Systems, pp. 109\u2013117 (2015)"},{"key":"9429_CR131","unstructured":"Zheng, Q., Lafferty, J.: Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent. arXiv preprint arXiv:1605.07051 (2016)"},{"key":"9429_CR132","unstructured":"Zhong, K., Song, Z., Jain, P., Bartlett, P.L., Dhillon, I.S.: Recovery guarantees for one-hidden-layer neural networks. In: International Conference on Machine Learning, pp. 4140\u20134149. JMLR. org (2017)"},{"issue":"2","key":"9429_CR133","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/17M1122025","volume":"28","author":"Y Zhong","year":"2018","unstructured":"Zhong, Y., Boumal, N.: Near-optimal bounds for phase synchronization. SIAM Journal on Optimization 28(2), 989\u20131016 (2018)","journal-title":"SIAM Journal on Optimization"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09429-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-019-09429-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09429-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T05:43:05Z","timestamp":1664084585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-019-09429-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":133,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["9429"],"URL":"https:\/\/doi.org\/10.1007\/s10208-019-09429-9","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,5]]},"assertion":[{"value":"14 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}