The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Phase recovery, MaxCut and complex semidefinite programming
Open accessAbstract
Phase retrieval seeks to recover a signal x∈Cp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x \in {\mathbb {C}}^p$$\end{document} from the amplitude |Ax|\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|A x|$$\end{document} of linear measurements Ax∈Cn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Ax \in {\mathbb {C}}^n$$\end{document}. We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar to that of the original greedy algorithm in Gerchberg and Saxton (Optik 35:237–246, 1972), where each iteration is a matrix vector product. Numerical results show the performance of this approach over three different phase retrieval problems, in comparison with greedy phase retrieval algorithms and matrix completion formulations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Phase retrieval algorithms: a comparison
Fienup, J. R. (1982) · Applied Optics · doi:10.1364/ao.21.002758 · Cited by 5,596
A practical algorithm for the determination of phase from image and diffraction plane pictures
Gerchberg, R. W. (1972) · Optik · Cited by 4,519
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831050 · Cited by 2,895
Bhatia, R. (1996) · Cited by 2,847
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
Bhatia, R. (1997) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0653-8 · Cited by 2,336
Signal estimation from modified short-time Fourier transform
Griffin, D., & Lim, J. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164317 · Cited by 2,095
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
Candès, E. J., Strohmer, T., & Voroninski, V. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21432 · Cited by 1,197
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
An Interior-Point Method for Semidefinite Programming
Helmberg, C., Rendl, F., Vanderbei, R. J., & Wolkowicz, H. (1996) · SIAM Journal on Optimization · doi:10.1137/0806020 · Cited by 706
Multiresolution spectrotemporal analysis of complex sounds
Chi, T., Ru, P., & Shamma, S. A. (2005) · The Journal of the Acoustical Society of America · doi:10.1121/1.1945807 · Cited by 673
SDPT3 -- A Matlab Software Package for Semidefinite Programming
Toh, K.-C., Todd, M. J., & Tütüncü, R. H. (1996) · eCommons (Cornell University) · Cited by 663
Templates for convex cone problems with applications to sparse signal recovery
Becker, S. R., Candès, E. J., & Grant, M. C. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0029-5 · Cited by 608
Fazel, M., Hindi, H., & Boyd, S. P. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1243393 · Cited by 574
Phase Retrieval via Matrix Completion
Candès, E. J., Eldar, Y. C., Strohmer, T., & Voroninski, V. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/110848074 · Cited by 565
ACOUSTICS. SPEECH. AND SIGNAL PROCESSING
Assp, V. (1983) · Cited by 556
Stewart, G. W. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718058 · Cited by 435
Semidefinite relaxation and nonconvex quadratic optimization
Nesterov, Y. (1998) · Optimization Methods and Software · doi:10.1080/10556789808805690 · Cited by 375
First-Order Methods for Sparse Covariance Selection
d'Aspremont, A., Banerjee, O., & El Ghaoui, L. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060670985 · Cited by 343
Self-citationAngular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns
Candès, E. J., & Li, X. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9162-z · Cited by 292
Miao, J., Ishikawa, T., Shen, Q., & Earnest, T. (2008) · Annual Review of Physical Chemistry · doi:10.1146/annurev.physchem.59.032607.093642 · Cited by 241
On approximating complex quadratic optimization problems via semidefinite programming relaxations
So, A. M.-C., Zhang, J., & Ye, Y. (2007) · Mathematical Programming · doi:10.1007/s10107-006-0064-6 · Cited by 229
Sparse Signal Recovery from Quadratic Measurements via Convex Programming
Li, X., & Voroninski, V. (2013) · SIAM Journal on Mathematical Analysis · doi:10.1137/120893707 · Cited by 217
Sparsity-based single-shot subwavelength coherent diffractive imaging
Szameit, A., Shechtman, Y., Osherovich, E., Bullkich, E., Sidorenko, P., Dana, H., Steiner, S., Kley, E. B., Gazit, S., Cohen-Hyams, T., et al. (2012) · Nature Materials · doi:10.1038/nmat3289 · Cited by 213
Complex Quadratic Optimization and Semidefinite Programming
Zhang, S., & Huang, Y. (2006) · SIAM Journal on Optimization · doi:10.1137/04061341x · Cited by 205
Laplacian eigenvalues and the maximum cut problem
Delorme, C., & Poljak, S. (1993) · Mathematical Programming · doi:10.1007/bf01585184 · Cited by 179
Smoothing Technique and its Applications in Semidefinite Optimization
Nesterov, Y. E. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0001-8 · Cited by 140
Stable Optimizationless Recovery from Phaseless Linear Measurements
Demanet, L., & Hand, P. (2013) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-013-9305-2 · Cited by 124
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Goemans, M. X., & Williamson, D. P. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380838 · Cited by 118
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
So, A. M., Zhang, J., & Ye, Y. (2005) · Lecture notes in computer science · doi:10.1007/11496915_10 · Cited by 111
Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming
Goemans, M. X., & Williamson, D. P. (2003) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2003.07.012 · Cited by 78
Block Coordinate Descent Methods for Semidefinite Programming
Wen, Z., Goldfarb, D., & Scheinberg, K. (2011) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4614-0769-0_19 · Cited by 49
Extended Matrix Cube Theorems with Applications to μ-Theory in Control
Ben‐Tal, A., Nemirovski, A. S., & Roos, C. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.3.497.16392 · Cited by 37
Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
Kisialiou, M., & Luo, Z.-Q. T. (2010) · SIAM Journal on Optimization · doi:10.1137/08072320x · Cited by 21
Approximating Eigenvectors by SubsamplingPreprint
Karoui, N. E., & d’Aspremont, A. (2009) · arXiv (Cornell University) · Cited by 3
Self-citation
Cited by
Invariant Scattering Convolution Networks
Bruna, J., & Mallat, S. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.230 · Cited by 1,633
Self-citationPhase Retrieval with Application to Optical Imaging: A contemporary overview
Shechtman, Y., Eldar, Y. C., Cohen, O., Chapman, H. N., Miao, J., & Segev, M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2352673 · Cited by 1,131
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Anden, J., & Mallat, S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2326991 · Cited by 666
Self-citationPhase Retrieval Using Alternating Minimization
Netrapalli, P., Jain, P., & Sanghavi, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2448516 · Cited by 535
Metadata
- Authors
- Waldspurger, I., d’Aspremont, A., & Mallat, S.
- Venue
- Mathematical Programming
- Published
- 2013-12-29
- Volume
- 149
- Issue
- 1-2
- Pages
- 47-81
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2145080587
- Cited by
- 573
- References
- 43
- FWCI
- 42.66
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.