Exact solutions in structured low-rank approximation

SIAM Journal on Matrix Analysis and Applications

Volumn 35, Issue 4, 2014, Pages 1521-1542

  Ottaviani, Giorgio ^a   Spaenlehauer, Pierre Jean ^b   Sturmfels, Bernd ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITÉ DE LORRAINE   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Euclidean distance degree; Gr bner bases; Low rank approximation

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION;

ALGEBRAIC GEOMETRY; EUCLIDEAN DISTANCE; EXACT SOLUTION; HANKEL MATRIX; LINEAR SPACES; LOW RANK APPROXIMATIONS; OPTIMIZATION PROBLEMS; SYLVESTER MATRICES;

MATRIX ALGEBRA;

EID: 84919880161     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/13094520X     Document Type: Article

References (24)

1. D. Bates, J. Hauenstein, A. Sommese, and C. Wampler, Numerically Solving Polynomial Systems with Bertini, SIAM, Philadelphia, 2013.
2. G. Blekherman, P. Parrilo, and R. Thomas, Semidefinite Optimization and Convex Algebraic Geometry, MOS-SIAM Ser. Optim. 13, SIAM, Philadelphia, 2013.
3. H.-C.G. von Bothmer, and K. Ranestad, A general formula for the algebraic degree in semidefinite programming, Bull. Lond. Math. Soc., 41 (2009), pp. 193-197.
4. F. Catanese, S. Hoşten, A. Khetan, and B. Sturmfels, The maximum likelihood degree, Amer. J. Math., 128 (2006), pp. 671-697.
5. M. Chu, R. Funderlic, and R. Plemmons, Structured low rank approximation, Linear Algebra Appl., 366 (2003), pp. 157-172.
6. J. Draisma, E. Horobeţ, G. Ottaviani, B. Sturmfels, and R. Thomas, The Euclidean distance degree of an algebraic variety, Found. Comput. Math., to appear.
7. I. Dolgachev and M. Kapranov, Arrangement of hyperplanes and vector bundles on Pn, Duke Math. J., 71 (1993), pp. 633-664.
8. J.-C. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5), in Proceedings of ISSAC 2002, pp. 75-83.
9. S. Friedland and M. Stawiska, Best approximation on semi-algebraic sets and k-border rank approximation of symmetric tensors, arXiv:1311.1561, 2013.
10. W. Fulton, Intersection Theory, Springer, Berlin, 1998.
11. M. Golubitsky and V. Guillemin, Stable Mappings and their Singularities, Springer, Berlin, 1974.
12. D.R. Grayson and M.E. Stillman, Macaulay2, a Software System for Research in Algebraic Geometry, http://www.math.uiuc.edu/Macaulay2/Citing/.
13. A. Holme, The geometric and numerical properties of duality in projective algebraic geometry, Manuscripta Math., 61 (1988), pp. 145-162.
14. N.K. Karmarkar and Y.N. Lakshman, On approximate GCDs of univariate polynomials, J. Symbolic Comput., 26 (1998), pp. 653-666.
15. E. Kaltofen, Z. Yang, and L. Zhi, Structured low rank approximation of a Sylvester matrix, in Symbolic-Numeric Computation, Trends in Mathematics, D. Wang and L. Zhi, eds., Birkhäuser, Basel, Switzerland, 2007, pp. 69-83.
16. J.M. Landsberg, Tensors: Geometry and Applications, Grad. Stud. Math. 128, AMS, Providence, RI, 2012.
17. J.H. Manton, R. Mahony, and Y. Hua, The geometry of weighted low-rank approximation, IEEE Trans. Signal Process., 51 (2003), pp. 500-514.
18. I. Markovski, Structured low-rank approximation and its applications, Automatica J. IFAC, 44 (2008), pp. 891-909.
19. R. Piene, Polar classes of singular varieties, Ann. Sci. Éc. Norm. Supér. (4), 11 (1978), pp. 247-276.
20. C. Raicu, Secant varieties of Segre-Veronese varieties, Algebra Number Theory, 6 (2012), pp. 1817-1868.
21. K. Ranestad, Algebraic degree in semidefinite and polynomial optimization, in Handbook on Semidefinite, Conic and Polynomial Optimization, J.-B. Lasserre and M. Anjos, eds., Springer, Berlin, 2012, pp. 61-75.
22. W. Rey, On weighted low-rank approximation, arXiv:1302.0360, 2013.
23. T. Schultz, A. Fuster, A. Ghosh, R. Deriche, L. Florack, and L.-H. Lim, Higher-order tensors in diffusion imaging, in Visualization and Processing of Tensors and Higher Order Descriptors for Multi-Valued Data, Springer, Berlin, 2013, pp. 129-161.
24. N. Srebro and T. Jaakkola, Weighted low-rank approximations, in Proceedings of the International Conference on Machine Learning, 2003, pp. 720-727.