E. Arbarello, M. Cornalba, P. Griffiths, and J. Harris, Geometry of Algebraic Curves. Volume I, Grundlehren der Mathematischen Wissenschaften, vol.267, 1985.

B. Bank, M. Giusti, J. Heintz, G. Lecerf, G. Matera et al., Degeneracy Loci and Polynomial Equation Solving, Foundations of Computational Mathematics, vol.15, issue.1, pp.159-184, 2015.
DOI : 10.1007/978-3-662-21581-4
URL : http://arxiv.org/pdf/1306.3390

B. Bank, M. Giusti, J. Heintz, and G. Mbakop, Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case, Journal of Complexity, vol.13, issue.1, pp.5-27, 1997.
DOI : 10.1006/jcom.1997.0432
URL : https://doi.org/10.1006/jcom.1997.0432

B. Bank, M. Giusti, J. Heintz, and G. Mbakop, Polar varieties and efficient real elimination, Mathematische Zeitschrift, vol.238, issue.1, pp.115-144, 2001.
DOI : 10.1007/PL00004896

B. Bank, M. Giusti, J. Heintz, and L. Pardo, Generalized polar varieties and efficient real elimination procedure, Kybernetika, vol.40, issue.5, pp.519-550, 2004.
DOI : 10.1007/pl00004896

B. Bank, M. Giusti, J. Heintz, and L. Pardo, Generalized polar varieties: geometry and algorithms, Journal of Complexity, vol.21, issue.4, pp.377-412, 2005.
DOI : 10.1016/j.jco.2004.10.001
URL : https://doi.org/10.1016/j.jco.2004.10.001

B. Bank, M. Giusti, J. Heintz, and L. Pardo, Bipolar varieties and real solving of a singular polynomial equation, Jaen Journal of Approximation, vol.2, issue.1, pp.65-77, 2010.

B. Bank, M. Giusti, J. Heintz, and M. , Intrinsic complexity estimates in polynomial optimization, Journal of Complexity, vol.30, issue.4, pp.430-443, 2014.
DOI : 10.1016/j.jco.2014.02.005
URL : https://hal.archives-ouvertes.fr/hal-00815123

B. R. Barmish, New tools for robustness of linear systems, 1994.

S. Basu, R. Pollack, and M. Roy, Algorithms in real algebraic geometry, Algorithms and Computation in Mathematics, vol.10, 2006.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

A. Ben-tal and A. Nemirovski, Lectures on modern convex optimization, 2001.
DOI : 10.1137/1.9780898718829
URL : http://iew3.technion.ac.il/Labs/Opt/opt/LN/Final.pdf

G. Blekherman, P. A. Parrilo, and R. R. Thomas, Semidefinite optimization and convex algebraic geometry, 2013.
DOI : 10.1137/1.9781611972290

B. Bonnard, J. Faugère, A. Jacquemard, M. Safey-el-din, and T. Verron, Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, 2016.
DOI : 10.1007/BF02713938
URL : https://hal.archives-ouvertes.fr/hal-01307073

B. Bonnard, O. Cots, J. Faugère, A. Jacquemard, J. Rouot et al., Algebraic-geometric techniques for the feedback classification and robustness of the optimal control of a pair of Bloch equations with application to Magnetic Resonance Imaging, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01556806

W. Bruns and U. Vetter, Determinantal rings, 1988.
DOI : 10.1007/bfb0080378

E. J. Candès, Mathematics of sparsity (and a few other things), Proceedings of the International Congress of Mathematicians, 2014.

G. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decompostion, Automata Theory and Formal Languages, pp.134-183
DOI : 10.1007/3-540-07407-4_17

D. A. Cox, J. Little, and D. Shea, Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra, 2007.

J. Draisma and J. Rodriguez, Maximum Likelihood Duality for Determinantal Varieties, International Mathematics Research Notices, vol.2014, issue.20, 2013.
DOI : 10.1093/imrn/rnt128
URL : http://arxiv.org/pdf/1211.3196.pdf

J. Draisma, E. Horobet, G. Ottaviani, B. Sturmfels, and R. R. Thomas, The Euclidean Distance Degree of an Algebraic Variety, Foundations of Computational Mathematics, vol.70, issue.2, 2015.
DOI : 10.1017/CBO9780511546556

D. Eisenbud, Commutative algebra with a view toward algebraic geometry, 1995.

J. Faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, vol.139, pp.1-361, 1999.

J. Faugère, A new efficient algorithm for computing Gröbner bases without reductions to zero (F5), Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), 2002.

J. Faugère, FGb: A Library for Computing Gr??bner Bases, Mathematical Software?ICMS 2010, pp.84-87, 2010.
DOI : 10.1007/978-3-642-15582-6_17

J. Faugère, P. Gaudry, L. Huot, and G. Renault, Polynomial systems solving by fast linear algebra, 2013.

J. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology, Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), 2010.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Gr??bner bases of bihomogeneous ideals generated by polynomials of bidegree <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>: Algorithms and complexity, Journal of Symbolic Computation, vol.46, issue.4, pp.406-437, 2011.
DOI : 10.1016/j.jsc.2010.10.014

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, Critical points and Gröbner bases: the unmixed case, Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), 2012.

J. Faugère, M. Safey-el-din, and P. Spaenlehauer, On the complexity of the generalized MinRank problem, Journal of Symbolic Computation, vol.55, pp.30-58, 2013.
DOI : 10.1016/j.jsc.2013.03.004

J. Faugère and C. Mou, Sparse FGLM algorithms, Journal of Symbolic Computation, vol.80, 2013.
DOI : 10.1016/j.jsc.2016.07.025

J. Faugère and C. Mou, Fast algorithm for change of ordering of zerodimensional Gröbner bases with sparse multiplication matrices, Proceedings of the International Symposium on Symbolic and Algebraic Computation (IS- SAC), 2011.

P. Gianni and T. Mora, Algebraic solution of systems of polynomial equations using Groebner bases, AAECC (LNCS), pp.247-257, 1989.

M. Giusti, J. Heintz, J. Morais, and L. Pardo, When polynomial equation systems can be ???solved??? fast?, AAECC-11, pp.205-231, 1995.
DOI : 10.1007/3-540-60114-7_16

M. Giusti, J. Heintz, J. Morais, and L. Pardo, Le r??le des structures de donn??es dans les probl??mes d'??limination, Comptes Rendus de l'Acad??mie des Sciences - Series I - Mathematics, vol.325, issue.11, pp.1223-1228, 1997.
DOI : 10.1016/S0764-4442(97)83558-6

M. Giusti, J. Heintz, J. Morais, J. Morgenstern, and L. Pardo, Straight-line programs in geometric elimination theory, Journal of Pure and Applied Algebra, vol.124, issue.1-3, pp.101-146, 1998.
DOI : 10.1016/S0022-4049(96)00099-0
URL : https://doi.org/10.1016/s0022-4049(96)00099-0

M. Giusti, G. Lecerf, and B. Salvy, A Gr??bner Free Alternative for Polynomial System Solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571
URL : https://doi.org/10.1006/jcom.2000.0571

M. Golubitsky and V. Guillemin, Stable mappings and their singularities, p.2012
DOI : 10.1007/978-1-4615-7904-5

A. Greuet and M. Safey-el-din, Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set, SIAM Journal on Optimization, vol.24, issue.3, pp.1313-1343, 2014.
DOI : 10.1137/130931308
URL : https://hal.archives-ouvertes.fr/hal-00849523

D. Grigoriev and N. Vorobjov, Solving systems of polynomial inequalities in subexponential time, Journal of Symbolic Computation, vol.5, issue.1-2, pp.37-64, 1988.
DOI : 10.1016/S0747-7171(88)80005-1

R. Hartshorne, Algebraic Geometry. Graduate texts in mathematics, p.52, 1977.

J. W. Helton and J. Nie, Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets, SIAM Journal on Optimization, vol.20, issue.2, pp.759-791, 2009.
DOI : 10.1137/07070526X

D. Henrion, S. Naldi, and M. , Real root finding for determinants of linear matrices, Journal of Symbolic Computation, vol.74, pp.205-238, 2016.
DOI : 10.1016/j.jsc.2015.06.010
URL : https://hal.archives-ouvertes.fr/hal-01077888

D. Henrion, S. Naldi, and M. , Safey El Din Real root finding for rank defects in linear Hankel matrices, Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2015.

J. Hauenstein, J. Rodriguez, and B. Sturmfels, Maximum Likelihood for Matrices with Rank Constraints, Journal of Algebraic Statistics, vol.5, issue.1, pp.18-38, 2014.
DOI : 10.18409/jas.v5i1.23

Z. Jelonek, Testing sets for properness of polynomial mappings, Mathematische Annalen, vol.315, issue.1, pp.1-35, 1999.
DOI : 10.1007/s002080050316

G. Jeronimo, G. Matera, P. Solernó, and A. Waissbein, Deformation Techniques for Sparse Systems, Foundations of Computational Mathematics, vol.31, issue.3, pp.1-50, 2009.
DOI : 10.1007/978-1-4615-3188-3
URL : http://arxiv.org/pdf/math/0608714

L. Kronecker, 1882 Grundzüge einer arithmetischen Theorie der algebraischen Grössen, Journal für die reine und angewandte Mathematik, vol.92, pp.1-122, 1882.

V. Ku?era, Discrete linear control: the polynomial approach, 1979.

J. B. Lasserre, Moments, positive polynomials and their applications, 2010.
DOI : 10.1142/p665

S. Lang, Linear Algebra, 1987.
DOI : 10.1007/978-1-4757-1949-9

M. Laurent, Sums of squares, moment matrices and optimization over polynomials . Pages 157-270 in Emerging applications of algebraic geometry, of IMA Volumes in Mathematics and its Applications, 2009.
DOI : 10.1007/978-0-387-09686-5_7
URL : http://homepages.cwi.nl/~monique/files/moment-ima.pdf

G. Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.209-216, 2000.
DOI : 10.1145/345542.345633
URL : https://hal.archives-ouvertes.fr/hal-00186755

A. Logar, A computational proof of the Noether normalization lemma, Applied Algebra, pp.259-273, 1989.
DOI : 10.1007/3-540-51083-4_65

F. S. Macaulay, The Algebraic Theory of Modular Systems, 1916.

I. Markovsky, Low rank approximation: algorithms, implementation, applications . Communications and Control Engineering, 2012.
DOI : 10.1007/978-1-4471-2227-2
URL : http://eprints.ecs.soton.ac.uk/13379/1/slra.pdf

E. Miller and B. Sturmfels, Combinatorial commutative algebra, Springer Science & Business Media, vol.227, 2004.

H. D. Mittelmann, The State-of-the-Art in Conic Optimization Software, Handbook of Semidefinite, Cone and Polynomial Optimization (M. Anjos and J. Lasserre eds), International Series in Operations Research and Management Science, 2012.
DOI : 10.1007/978-1-4614-0769-0_23

A. , N. Sanz-sol, J. Soria, J. L. Varona, and J. Verdera, Advances in convex optimization: conic programming. Pages 413-444 in M, Proceedings of International Congress of Mathematicians, 2006.

G. Ottaviani, P. Spaenlehauer, and B. , Exact Solutions in Structured Low-Rank Approximation, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.4, pp.1521-1542, 2014.
DOI : 10.1137/13094520X
URL : https://hal.archives-ouvertes.fr/hal-00953702

J. Nie, K. Ranestad, and B. Sturmfels, The algebraic degree of semidefinite programming, Mathematical Programming, vol.296, issue.12, pp.379-405, 2010.
DOI : 10.1007/978-1-4615-4381-7

D. Perrin, Algebraic geometry: an introduction, 2008.
DOI : 10.1007/978-1-84800-056-8

A. Poteaux and . Schost, On the complexity of computing with zero-dimensional triangular sets, Journal of Symbolic Computation, vol.50, issue.0, pp.110-138, 2013.
DOI : 10.1016/j.jsc.2012.05.008
URL : https://hal.archives-ouvertes.fr/hal-00825847

K. Ranestad, Algebraic Degree in Semidefinite and Polynomial Optimization, Handbook on Semidefinite, Conic and Polynomial Optimization, pp.61-75
DOI : 10.1007/978-1-4614-0769-0_3

F. Rouillier, Solving Zero-Dimensional Systems Through the Rational Univariate Representation, Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.
DOI : 10.1007/s002000050114
URL : https://hal.archives-ouvertes.fr/inria-00098872

M. Safey-el-din, Raglib (real algebraic geometry library), Maple package

M. Safey-el-din, Finding sampling points on real hypersurfaces is easier in singular situations, Electronic proceedings of MEGA (Effective Methods in Algebraic Geometry), 2005.

M. Safey-el-din and E. Schost, Polar varieties and computation of one point in each connected component of a smooth real algebraic set, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, 2003.
DOI : 10.1145/860854.860901
URL : https://hal.archives-ouvertes.fr/inria-00099649

M. Safey-el-din and E. Schost, A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets, Journal of the ACM Article N, vol.63, issue.48, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00849057

M. Safey-el-din and E. Schost, Bit complexity for multi-homogeneous polynomial system solvingApplication to polynomial minimization, Journal of Symbolic Computation, 2017.

I. Shafarevich, Basic algebraic geometry 1, 1977.
DOI : 10.1007/978-3-642-37956-7

A. J. Sommese and C. W. Wampler, The numerical solution of systems of polynomials arising in engineering and science, Pte. Ltd, 2005.
DOI : 10.1142/5763

A. Tarski, A Decision Method for Elementary Algebra and Geometry, 1951.
DOI : 10.1007/978-3-7091-9459-1_3

J. H. Wilkinson, The algebraic eigenvalue problem, 1965.

J. Harris, Algebraic geometry. A first course, 1992.