Hidden Convexity, Optimization, and Algorithms on Rotation Matrices

Published Online:https://doi.org/10.1287/moor.2023.0114

References

  • [1] Bandeira AS, Chen Y, Lederman RR, Singer A (2020) Non-unique games over compact groups and orientation estimation in cryo-EM. Inverse Problems 36(6):064002.CrossrefGoogle Scholar
  • [2] Barvinok A (2002) A Course in Convexity, Graduate Studies in Mathematics, vol. 54 (American Mathematical Society, Providence, RI).CrossrefGoogle Scholar
  • [3] Blekherman G, Smith G, Velasco M (2016) Sums of squares and varieties of minimal degree. J. Amer. Math. Soc. 29(3):893–913.CrossrefGoogle Scholar
  • [4] Brickman L (1961) On the field of values of a matrix. Proc. Amer. Math. Soc. 12(1):61–66.CrossrefGoogle Scholar
  • [5] Brynte L, Larsson V, Iglesias JP, Olsson C, Kahl F (2022) On the tightness of semidefinite relaxations for rotation estimation. J. Math. Imaging Vision 64(1):57–67.CrossrefGoogle Scholar
  • [6] Chan N, Li K (1983) Diagonal elements and eigenvalues of a real symmetric matrix. J. Math. Anal. Appl. 91(2):562–566.CrossrefGoogle Scholar
  • [7] Chen Y, Huang S, Fitch R (2020) Active SLAM for mobile robots with area coverage and obstacle avoidance. IEEE/ASME Trans. Mechatronics 25(3):1182–1192.CrossrefGoogle Scholar
  • [8] Diamond S, Boyd S (2016) CVXPY: A Python-embedded modeling language for convex optimization. J. Machine Learn. Res. 17(1):2909–2913.Google Scholar
  • [9] Dines LL (1941) On the mapping of quadratic forms. Bull. Amer. Math. Soc. (N.S.) 47(6):494–498.CrossrefGoogle Scholar
  • [10] Farrell JL, Stuelpnagel JC, Wessner RH, Velman JR, Brook JE (1966) A least squares estimate of satellite attitude (Grace Wahba). SIAM Rev. 8(3):384–386.Google Scholar
  • [11] Fertin G, Rusu I, Vialette S (2015) Obtaining a triangular matrix by independent row-column permutations. Elbassioni K, Makino K, eds. Algorithms and Computation (ISAAC 2015) (Springer, Berlin, Heidelberg), 165–175.Google Scholar
  • [12] Fiedler M (2009) Suborthogonality and orthocentricity of matrices. Linear Algebra Appl. 430(1):296–307.CrossrefGoogle Scholar
  • [13] Fradkov A, Yakubovich V (1979) The S-procedure and duality relations in nonconvex problems of quadratic programming. Vestn. LGU Ser. Mat. Mekh. Astron. 5(1):101–109.Google Scholar
  • [14] Gilman K, Burer S, Balzano L (2022) A semidefinite relaxation for sums of heterogeneous quadratics on the Stiefel manifold. Preprint, submitted May 26, https://arxiv.org/abs/2205.13653v1.Google Scholar
  • [15] Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169–197.CrossrefGoogle Scholar
  • [16] Grötschel M, Lovász L, Schrijver A (2012) Geometric Algorithms and Combinatorial Optimization, Algorithmics and Combinatorics, vol. 2 (Springer Science & Business Media, Berlin).Google Scholar
  • [17] Guillemin V, Sjamaar R (2005) Convexity Properties of Hamiltonian Group Actions (American Mathematical Society, Providence, RI).Google Scholar
  • [18] Hatcher A (2002) Algebraic Topology (Cambridge University Press, Cambridge, UK).Google Scholar
  • [19] Horn A (1954) Doubly stochastic matrices and the diagonal of a rotation matrix. Amer. J. Math. 76(3):620–630.CrossrefGoogle Scholar
  • [20] Horn RA, Johnson CR (2012) Matrix Analysis (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • [21] Jeroslow RG (1975) On defining sets of vertices of the hypercube by linear inequalities. Discrete Math. 11(2):119–124.CrossrefGoogle Scholar
  • [22] Kiefer J (1953) Sequential minimax search for a maximum. Proc. Amer. Math. Soc. 4(3):502–506.CrossrefGoogle Scholar
  • [23] Lancia G, Serafini P (2018) Compact Extended Linear Programming Models (Springer International Publishing, Cham, Switzerland), 113–121.CrossrefGoogle Scholar
  • [24] Lee U, Mesbahi M (2011) Spacecraft reorientation in presence of attitude constraints via logarithmic barrier potentials. Proc. 2011 Amer. Control Conf. (IEEE, Piscataway, NJ), 450–455.Google Scholar
  • [25] Maron H, Dym N, Kezurer I, Kovalsky S, Lipman Y (2016) Point registration via efficient convex relaxation. ACM Trans. Graphics 35(4):1–12.CrossrefGoogle Scholar
  • [26] Ovsjanikov M, Ben-Chen M, Solomon J, Butscher A, Guibas L (2012) Functional maps: A flexible representation of maps between shapes. ACM Trans. Graphics 31(4):1–11.CrossrefGoogle Scholar
  • [27] Pólik I, Terlaky T (2007) A survey of the S-lemma. SIAM Rev. 49(3):371–418.CrossrefGoogle Scholar
  • [28] Saunderson J, Parrilo P, Willsky AS (2015) Semidefinite descriptions of the convex hull of rotation matrices. SIAM J. Optim. 25(3):1314–1343.CrossrefGoogle Scholar
  • [29] Tam TY (2001) On the shape of numerical ranges associated with Lie groups. Taiwanese J. Math. 5(3):497–506.CrossrefGoogle Scholar
  • [30] Xia Y (2020) A survey of hidden convex optimization. J. Oper. Res. Soc. China 8(1):1–28.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.