Numerical methods for unconstrained optimization and nonlinear equations, 1996. ,
DOI : 10.1137/1.9781611971200
Tensor Methods for Nonlinear Equations, SIAM Journal on Numerical Analysis, vol.21, issue.5, pp.815-843, 1984. ,
DOI : 10.1137/0721054
Using algebraic geometry, 2006. ,
DOI : 10.1007/978-1-4757-6911-1
Semidefinite programming relaxations for semialgebraic problems, Mathematical Programming, vol.96, issue.2, pp.293-320, 2003. ,
DOI : 10.1007/s10107-003-0387-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3194
Global Optimization with Polynomials and the Problem of Moments, SIAM Journal on Optimization, vol.11, issue.3, pp.796-817, 2001. ,
DOI : 10.1137/S1052623400366802
Border basis relaxation for polynomial optimization, Journal of Symbolic Computation, vol.74, pp.378-399, 2016. ,
DOI : 10.1016/j.jsc.2015.08.004
URL : https://hal.archives-ouvertes.fr/hal-00981546
Numerical solution of multivariate polynomial systems by homotopy continuation methods, Acta Numerica, vol.107, issue.6, pp.399-436, 1997. ,
DOI : 10.1007/BF01389312
Polynomial homotopies for dense, sparse and determinantal systems, Mathematical Systems Research Institute (MSRI), pp.1999-2040 ,
An Overview of Low-Rank Matrix Recovery From Incomplete Observations, IEEE Journal of Selected Topics in Signal Processing, vol.10, issue.4, pp.608-622, 2016. ,
DOI : 10.1109/JSTSP.2016.2539100
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets, computational complexity, vol.14, issue.1, pp.20-52, 2005. ,
DOI : 10.1007/s00037-005-0189-7
URL : https://hal.archives-ouvertes.fr/hal-00725128
Nash Equilibria via Polynomial Equations, Theoretical Informatics, pp.413-422, 2004. ,
DOI : 10.1007/978-3-540-24698-5_45
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, pp.392-407, 2000. ,
DOI : 10.1007/3-540-45539-6_27
Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited, Public Key Cryptography?PKC 2012, pp.156-171, 2012. ,
DOI : 10.1007/978-3-642-30057-8_10
Applications of Gr??bner bases to signal and image processing: a survey, Linear Algebra and its Applications, vol.391, pp.169-202, 2004. ,
DOI : 10.1016/j.laa.2004.01.008
Symmetric tensor decomposition, Linear Algebra and its Applications, vol.433, issue.11-12, pp.1851-1872, 2010. ,
DOI : 10.1016/j.laa.2010.06.046
URL : https://hal.archives-ouvertes.fr/inria-00355713
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.3, pp.1084-1127, 2008. ,
DOI : 10.1137/06066518X
Some convergence results on the Regularized Alternating Least-Squares method for tensor decomposition, Linear Algebra and its Applications, vol.438, issue.2, pp.796-812, 2013. ,
DOI : 10.1016/j.laa.2011.12.002
Semidefinite Relaxations for Best Rank-1 Tensor Approximations, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.3, pp.1155-1179, 2014. ,
DOI : 10.1137/130935112
URL : http://arxiv.org/abs/1308.6562
Tensor Decompositions and Applications, Tensor decompositions and applications, pp.455-500, 2009. ,
DOI : 10.1137/07070111X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.782
Best rank one approximation of real symmetric tensors can be chosen symmetric, Frontiers of Mathematics in China, vol.37, issue.1, pp.19-40, 2013. ,
DOI : 10.1002/cpa.3160370104
URL : http://arxiv.org/abs/1110.5689
Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation, SIAM Journal on Matrix Analysis and Applications, vol.33, issue.2, pp.639-652, 2012. ,
DOI : 10.1137/110843587