Fetching the paper…
Reading the bibliography…
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem.
J. Gower, Generalized procrustes analysis, Psychometrika 40 (1) (1975) 33–51
1975
Earlier work this paper cites.
J. B. Keller, Closest unitary, orthogonal and Hermitian operators to a given operator, Mathematics Magazine 48 (4) (1975) 192–197
1975
Earlier work this paper cites.
J. Ten Berge, Orthogonal procrustes rotation for two or more matrices, Psychometrika 42 (2) (1977) 267–276
1977
Earlier work this paper cites.
Z. Kam, The reconstruction of structure from electron micrographs of randomly oriented particles, Journal of Theoretical Biology 82 (1) (1980) 15 – 39
1980
Earlier work this paper cites.
A. Shapiro, J. D. Botha, Dual algorithm for orthogonal procrustes rotations, SIAM Journal on Matrix Analysis and Applications 9 (3) (1988) 378–383
1988
Earlier work this paper cites.
M. X. Goemans, D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (6) (1995) 1115–1145
1995
Earlier work this paper cites.
H. R. Tütüncü, C. K. Toh, J. M. Todd, Solving semidefinite-quadratic-linear programs using sdpt3, Mathematical Programming 95 (2) (2003) 189–217
2003
Cited alongside, same era.
J. Lee, Introduction to Smooth Manifolds, Graduate Texts in Mathematics, Springer, 2003
2003
Cited alongside, same era.
A. Nemirovski, Sums of random symmetric matrices and quadratic optimization under orthogonality constraints, Mathematical Programming 109 (2-3) (2007) 283–317
2007
Cited alongside, same era.
A. M.-C. So, J. Zhang, Y. Ye, On approximating complex quadratic optimization problems via semidefinite programming relaxations, Math. Program. 110 (1) (2007) 93–110
2007
Cited alongside, same era.
A.-C. So, Moment inequalities for sums of random matrices and their applications in optimization, Mathematical Programming 130 (1) (2011) 125–151
A. Naor, O. Regev, T. Vidick, Efficient rounding for the noncommutative grothendieck inequality, in: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC ’13, 2013, pp. 71–80
2013
Later among the works it cites.
M. Grant, S. Boyd, CVX: Matlab software for disciplined convex programming, version 2.1, http://cvxr.com/cvx (Mar. 2014)
2014
Later among the works it cites.
T. Bhamre, T. Zhang, A. Singer, Orthogonal matrix retrieval in cryo-electron microscopy, 12th IEEE International Symposium on Biomedical Imaging (ISBI 2015)
2015
Closest in time.
A. S. Bandeira, C. Kennedy, A. Singer, Approximating the little Grothendieck problem over the orthogonal and unitary groups, Mathematical Programming (2016) 1–43
2016
Closest in time.
A. S. Bandeira, C. Kennedy, A. Singer, Approximating the little grothendieck problem over the orthogonal and unitary groups, Mathematical Programming 160 (1) (2016) 433–475
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
J. Gower, G. Dijksterhuis, Procrustes Problems, Oxford Statistical Science Series
Cited in the paper.
2016
Closest in time.