Nonconvex phase synchronization
From MaRDI portal
Abstract: We estimate phases (angles) from noisy pairwise relative phase measurements. The task is modeled as a nonconvex least-squares optimization problem. It was recently shown that this problem can be solved in polynomial time via convex relaxation, under some conditions on the noise. In this paper, under similar but more restrictive conditions, we show that a modified version of the power method converges to the global optimum. This is simpler and (empirically) faster than convex approaches. Empirically, they both succeed in the same regime. Further analysis shows that, in the same noise regime as previously studied, second-order necessary optimality conditions for this quadratically constrained quadratic program are also sufficient, despite nonconvexity.
Recommendations
- Non-transitive maps in phase synchronization
- Near-optimal bounds for phase synchronization
- Synchronization of nonidentical coupled systems
- Synchronization in nonlinear oscillators with conjugate coupling
- Phase synchronization
- Phase synchronization between nonlinearly coupled Rössler systems
- Synchronization of non-chaotic dynamical systems
- Phase synchronization of coupling systems
- Synchronization and non-smooth dynamical systems
- Phase synchronization of chaotic systems based on nonlinear observers
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- A Cheeger Inequality for the Graph Connection Laplacian
- A geometric analysis of phase retrieval
- Angular synchronization by eigenvectors and semidefinite programming
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Complex Quadratic Optimization and Semidefinite Programming
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Cramer-Rao bounds for synchronization of rotations
- Designing Unimodular Codes Via Quadratic Optimization
- Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
- Exact and stable recovery of rotations for robust synchronization
- Generalized power method for sparse principal component analysis
- Global rates of convergence for nonconvex optimization on manifolds
- Manopt, a Matlab toolbox for optimization on manifolds
- Non-Convex Phase Retrieval From STFT Measurements
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Phase Retrieval Using Alternating Minimization
- Phase recovery, MaxCut and complex semidefinite programming
- Phase retrieval from power spectra of masked signals
- Phase retrieval with polarization
- Phase transitions in semidefinite relaxations
- Probabilistic analysis of the semidefinite relaxation detector in digital communications
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Rotation averaging
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Trust-region methods on Riemannian manifolds
Cited in
(53)- The projected power method: an efficient algorithm for joint alignment from pairwise differences
- Dynamic angular synchronization under smoothness constraints
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- Joint community detection and rotational synchronization via semidefinite programming
- scientific article; zbMATH DE number 7370563 (Why is no real title available?)
- On recovery guarantees for angular synchronization
- Subgradient methods for sharp weakly convex functions
- Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
- A geometric analysis of phase retrieval
- Denoising modulo samples: \(k\)-NN regression and tightness of SDP relaxation
- Ellipsoidal embeddings of graphs
- Generalized orthogonal Procrustes problem under arbitrary adversaries
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
- Power spectrum unbiasing for dilation-invariant multi-reference alignment
- Orientation estimation of cryo-EM images using projected gradient descent method
- Near-optimal bounds for phase synchronization
- Multi-reference alignment in high dimensions: sample complexity and phase transition
- An extension of the angular synchronization problem to the heterogeneous setting
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- \(L^p\) continuity and microlocal properties for pseudodifferential operators
- A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods
- The noise-sensitivity phase transition in spectral group synchronization over compact groups
- SISAL revisited
- Rates of estimation for high-dimensional multireference alignment
- Optimal rates of estimation for multi-reference alignment
- Guarantees for Spontaneous Synchronization on Random Geometric Graphs
- Robust PCA by manifold optimization
- Riemannian trust region methods for \(\mathrm{SC}^1\) minimization
- Tightness of SDP and Burer-Monteiro factorization for phase synchronization in a high-noise regime
- On connections between amplitude flow and error reduction for phase retrieval and ptychography
- Using negative curvature in solving nonlinear programs
- A well-tempered landscape for non-convex robust subspace recovery
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions
- The Condition Number of Riemannian Approximation Problems
- Exact minimax optimality of spectral methods in phase synchronization and orthogonal group synchronization
- Asymptotic mutual information in quadratic estimation problems over compact groups
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
- Adaptive trust-region method on Riemannian manifold
- A unified approach to synchronization problems over subgroups of the orthogonal group
- On the landscape of synchronization networks: a perspective from nonconvex optimization
- A representation theory perspective on simultaneous alignment and classification
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
- A trust region method for finding second-order stationarity in linearly constrained nonconvex optimization
- Random multitype spanning forests for synchronization on sparse graphs
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Inference for heteroskedastic PCA with missing data
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
This page was built for publication: Nonconvex phase synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832892)
