Phase recovery, MaxCut and complex semidefinite programming
From MaRDI portal
Publication:2515033
DOI10.1007/s10107-013-0738-9zbMath1329.94018arXiv1206.0102OpenAlexW2145080587WikidataQ105443963 ScholiaQ105443963MaRDI QIDQ2515033
Irène Waldspurger, Alexandre d'Aspremont, Stephane Mallat
Publication date: 9 February 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0102
Semidefinite programming (90C22) Combinatorial optimization (90C27) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
The numerics of phase retrieval, Constructing confidence intervals for the signals in sparse phase retrieval, Reconstruction of signals from magnitudes of redundant representations: the complex case, Approximate message passing with spectral initialization for generalized linear models*, On the local stability of semidefinite relaxations, Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization, Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study, Phase retrieval of complex and vector-valued functions, On the effect of zero-flipping on the stability of the phase retrieval problem in the Paley-Wiener class, Phase retrieval for imaging problems, Admissible measurements and robust algorithms for ptychography, Algorithms and error bounds for noisy phase retrieval with low-redundancy frames, The discrete sign problem: uniqueness, recovery algorithms and phase retrieval applications, Phase retrieval using alternating minimization in a batch setting, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, On global convergence of gradient descent algorithms for generalized phase retrieval problem, Quantization-aware phase retrieval, The local convexity of solving systems of quadratic equations, Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations, Fundamental limits of weak recovery with applications to phase retrieval, The phase retrieval problem for solutions of the Helmholtz equation, Phase retrieval via sensor network localization, Dynamic Fourier ptychography with deep spatiotemporal priors, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Phase retrieval via sparse Wirtinger flow, A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, A Generalization of Wirtinger Flow for Exact Interferometric Inversion, Misspecified nonconvex statistical optimization for sparse phase retrieval, Compressive phase retrieval: Optimal sample complexity with deep generative priors, Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints, Hermitian completely positive matrices, Provable sample-efficient sparse phase retrieval initialized by truncated power method, Nearly optimal bounds for the global geometric landscape of phase retrieval, New semidefinite relaxations for a class of complex quadratic programming problems, Provable Phase Retrieval with Mirror Descent, Phase retrieval: a data-driven wavelet frame based approach, Phase transitions in semidefinite relaxations, A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem, Performance bounds of the intensity-based estimators for noisy phase retrieval, Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation, Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems, Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices, PhaseMax: Stable guarantees from noisy sub-Gaussian measurements, Well-conditioned ptychographic imaging via lost subspace completion, A brief introduction to manifold optimization, Phase retrieval from very few measurements, Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection, A perturbation view of level-set methods for convex optimization, Smoothed amplitude flow-based phase retrieval algorithm, Level-set methods for convex optimization, Phase retrieval from Fourier measurements with masks, Fourier phase retrieval with a single mask by Douglas-Rachford algorithms, Iterative phase retrieval by combining modulus constraints and angle relationships, Unnamed Item, Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming, On the Simplicity and Conditioning of Low Rank Semidefinite Programs, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Saving phase: injectivity and stability for phase retrieval, Fast rank-one alternating minimization algorithm for phase retrieval, Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval, A geometric analysis of phase retrieval, Total Variation--Based Phase Retrieval for Poisson Noise Removal, Variational Phase Retrieval with Globally Convergent Preconditioned Proximal Algorithm, Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data, A block coordinate variable metric forward-backward algorithm, Phase retrieval with PhaseLift algorithm, Phase retrieval for sub-Gaussian measurements, Phase retrieval from coded diffraction patterns, Uniqueness results in an extension of Pauli's phase retrieval problem, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, Low-Rank Spectral Optimization via Gauge Duality, Rank Optimality for the Burer--Monteiro Factorization, Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably, Benchmark Problems for Phase Retrieval, Nonconvex Phase Synchronization, Stable phase retrieval in infinite dimensions, Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization, A Proximal Operator for Multispectral Phase Retrieval Problems, Solving phase retrieval via graph projection splitting, Phase retrieval for wide band signals, Optimal combination of linear and spectral estimators for generalized linear models, Global Registration of Multiple Point Clouds Using Semidefinite Programming, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems, The Cramer–Rao lower bound in a non-AWGN model for the affine phase retrieval, Robust phase retrieval via median-truncated smoothed amplitude flow, Invertibility and robustness of phaseless reconstruction, The Global Landscape of Phase Retrieval II: Perturbed Amplitude Models, The Global Landscape of Phase Retrieval II: Quotient Intensity Models, Sampling complexity on phase retrieval from masked Fourier measurements via Wirtinger flow*, Stable phase retrieval with low-redundancy frames, Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem, Solving phase retrieval with random initial guess is nearly as good as by spectral initialization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable optimizationless recovery from phaseless linear measurements
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Angular synchronization by eigenvectors and semidefinite programming
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Smoothing technique and its applications in semidefinite optimization
- Phase retrieval for the Cauchy wavelet transform
- A predictor-corrector algorithm for the coupling of stiff ODEs to a particle population balance
- Laplacian eigenvalues and the maximum cut problem
- Templates for convex cone problems with applications to sparse signal recovery
- Perturbation theory for linear operators.
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- The convex geometry of linear inverse problems
- Exact matrix completion via convex optimization
- Matrix Algorithms
- Lectures on Modern Convex Optimization
- Block Coordinate Descent Methods for Semidefinite Programming
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Sparse Signal Recovery from Quadratic Measurements via Convex Programming
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
- Array imaging using intensity-only measurements
- On the Determination of the Phase of a Fourier Integral, I
- First-Order Methods for Sparse Covariance Selection
- Mathematical Considerations for the Problem of Fourier Transform Phase Retrieval from Magnitude
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- An Interior-Point Method for Semidefinite Programming
- Complex Quadratic Optimization and Semidefinite Programming
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- Phase Retrieval via Matrix Completion
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods