Author:
Brandt Madeline,Bruce Juliette,Brysiewicz Taylor,Krone Robert,Robeva Elina
Reference19 articles.
1. Martin Aigner and Günter Ziegler: Proofs from The Book, Fourth edition, Springer-Verlag, Berlin, 2010.
2. Hans-Christian Graf von Bothmer and Kristian Ranestad: A general formula for the algebraic degree in semidefinite programming, Bull. Lond. Math. Soc. 41 (2009) 193–197.
3. Stephen Boyd and Lieven Vandenberghe: Semidefinite programming relaxations of non-convex problems in control and combinatorial optimization, in Communications, Computation, Control, and Signal Processing, 279–287, Springer Science+Business Media, New York, 1997.
4. Taylor Brysiewicz: Experimenting to find many real points on slices of SO ( n , ℂ ) $$\mathop{\mathrm{SO}}\nolimits (n, \mathbb{C})$$ , www.math.tamu.edu/~tbrysiewicz/realitySonData.html .
5. Samuel Burer and Renato Monteiro: Local minima and convergence in low-rank semidefinite programming, Math. Program. Ser. A 103 (2005) 427–444.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Kernel Approximation on Algebraic Varieties;SIAM Journal on Applied Algebra and Geometry;2023-03-31
2. The 4 × 4 Orthostochastic Variety;Experimental Mathematics;2021-10-14
3. On the Tightness of Semidefinite Relaxations for Rotation Estimation;Journal of Mathematical Imaging and Vision;2021-10-07
4. Algebraic analysis of rotation data;Algebraic Statistics;2020-12-28
5. Coordinate-wise powers of algebraic varieties;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2020-01-16