Pages that link to "Item:Q526833"

The following pages link to Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833):

Displaying 39 items.

• Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
• A note on probably certifiably correct algorithms (Q1695210) (← links)
• Fundamental limits of symmetric low-rank matrix estimation (Q1740590) (← links)
• Random Laplacian matrices and convex relaxations (Q1750385) (← links)
• Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• Robust group synchronization via cycle-edge message passing (Q2098232) (← links)
• Mathematical foundations of machine learning. Abstracts from the workshop held March 21--27, 2021 (hybrid meeting) (Q2131208) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• An extension of the angular synchronization problem to the heterogeneous setting (Q2148952) (← links)
• Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
• Optimal rates of estimation for multi-reference alignment (Q2176073) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
• Hermitian completely positive matrices (Q2197205) (← links)
• The noise-sensitivity phase transition in spectral group synchronization over compact groups (Q2197955) (← links)
• On recovery guarantees for angular synchronization (Q2663272) (← links)
• On connections between amplitude flow and error reduction for phase retrieval and ptychography (Q2675194) (← links)
• Nonconvex Phase Synchronization (Q2832892) (← links)
• Phase transitions in semidefinite relaxations (Q2962328) (← links)
• On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization (Q4602339) (← links)
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection (Q4629340) (← links)
• Near-Optimal Bounds for Phase Synchronization (Q4637501) (← links)
• Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
• (Q4998937) (← links)
• (Q5053241) (← links)
• Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions (Q5065468) (← links)
• Universal inference (Q5073098) (← links)
• Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization (Q5231691) (← links)
• Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions (Q5867627) (← links)
• Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
• A unified approach to synchronization problems over subgroups of the orthogonal group (Q6117023) (← links)
• New semidefinite relaxations for a class of complex quadratic programming problems (Q6166105) (← links)
• Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
• Power spectrum unbiasing for dilation-invariant multi-reference alignment (Q6176089) (← links)
• A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem (Q6183088) (← links)