Approximating the little Grothendieck problem over the orthogonal and unitary groups
From MaRDI portal
Publication:344957
DOI10.1007/s10107-016-0993-7zbMath1356.90101arXiv1308.5207OpenAlexW2100685794WikidataQ42746594 ScholiaQ42746594MaRDI QIDQ344957
Afonso S. Bandeira, Amit Singer, Christopher A. Kennedy
Publication date: 25 November 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5207
Related Items
Cohomology of Cryo-Electron Microscopy ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ A brief introduction to manifold optimization ⋮ The geometry of synchronization problems and learning group actions ⋮ Disentangling orthogonal matrices ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ Nonconvex Phase Synchronization ⋮ Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality ⋮ Non-unique games over compact groups and orientation estimation in cryo-EM ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Angular synchronization by eigenvectors and semidefinite programming
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- Moment inequalities for sums of random matrices and their applications in optimization
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Introductory lectures on convex optimization. A basic course.
- Rate of convergence in probability to the Marchenko-Pastur law
- On maximization of quadratic form over intersection of ellipsoids with common center
- A generalized solution of the orthogonal Procrustes problem
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- Block Coordinate Descent Methods for Semidefinite Programming
- Random Matrix Methods for Wireless Communications
- Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming
- Approximating the cut-norm via Grothendieck's inequality
- The Positive Semidefinite Grothendieck Problem with Rank Constraint
- Computing the Polar Decomposition—with Applications
- Closest Unitary, Orthogonal and Hermitian Operators to a Given Operator
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Tight Hardness of the Non-commutative Grothendieck Problem
- Semidefinite Programming
- Global Registration of Multiple Point Clouds Using Semidefinite Programming
- Moments of Wishart-Laguerre and Jacobi ensembles of random matrices: application to the quantum transport problem in chaotic cavities
- Grothendieck’s Theorem, past and present
- A Cheeger Inequality for the Graph Connection Laplacian
- Efficient rounding for the noncommutative grothendieck inequality
- Some Metric Inequalities in the Space of Matrices
- Random Matrix Theory and Wireless Communications
- Quadratic forms on graphs
- On the singular values of Gaussian random matrices
This page was built for publication: Approximating the little Grothendieck problem over the orthogonal and unitary groups
