M. F. Anjos and J. B. Lasserre, Handbook on Semidefinite, Conic and Polynomial Optimization, 2012.
DOI : 10.1007/978-1-4614-0769-0

M. F. Anjos and J. B. Lasserre, Introduction to Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol.166, issue.1, p.28, 2012.
DOI : 10.1007/978-1-4614-0769-0_1

G. Blekherman, P. A. Parrilo, and R. R. Thomas, Semidefinite Optimization and Convex Algebraic Geometry, MOS-SIAM Series on Optimization. SIAM and MPS, p.28, 2013.
DOI : 10.1137/1.9781611972290

F. Capitanescu, Critical review of recent advances and further developments needed in AC optimal power flow Electric Power Systems Research, pp.57-68, 2016.

F. Capitanescu, J. L. Martinez-ramos, P. Panciatici, D. Kirschen, A. Marano-marcolini et al., State-of-the-art, challenges, and future trends in security constrained optimal power flow, Electric Power Systems Research, vol.81, issue.8, pp.1731-1741, 2011.
DOI : 10.1016/j.epsr.2011.04.003

M. J. Carpentier, Contribution à l'étude du dispatching économique, pp.431-447, 1962.

E. De-klerk, Aspects of Semidefinite Programming -Interior Point Algorithms and Selected Applications, pp.22-25, 2002.

A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, The central path visits all the vertices of the Klee-Minty cube. Optimization Methods and Software, pp.849-863, 2006.

C. Ferrier, Hilbert???s 17th problem and best dual bounds in quadratic minimization, Cybernetics and Systems Analysis, vol.2, issue.5, pp.696-709, 1998.
DOI : 10.1007/BF02667043

J. Ch and . Gilbert, Fragments d'Optimisation Différentiable ? Théorie et Algorithmes. Syllabus de cours à l'ENSTA, 2016.

J. Ch and . Gilbert, Step by step design of an interior point solver in semidefinite optimization ? Application to the Shor relaxation of some small OPF problems. Lecture notes of the Master-2 " Optimization, 2016.

J. Ch, C. Gilbert, and . Josz, Plea for a semidefinite optimization solver in complex numbers, p.43, 2016.

C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz, An Interior-Point Method for Semidefinite Programming, SIAM Journal on Optimization, vol.6, issue.2, pp.342-361, 1996.
DOI : 10.1137/0806020

B. Janssen, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Journal of Optimization Theory and Applications, vol.44, issue.1, pp.1-26, 1994.
DOI : 10.1007/BF02191759

J. Jiang, A long-step primal???dual path-following method for semidefinite programming, Operations Research Letters, vol.23, issue.1-2, pp.53-62, 1998.
DOI : 10.1016/S0167-6377(98)00018-2

C. Josz, S. Fliscounakis, J. Maeght, and P. Panciatici, The Matlab function qcqp_opf. Piece of software, p.43, 2015.

C. Josz, J. Maeght, P. Panciatici, J. Ch, and . Gilbert, Application of the Moment-SOS Approach to Global Optimization of the OPF Problem, IEEE Transactions on Power Systems, vol.30, issue.1, pp.463-470, 2015.
DOI : 10.1109/TPWRS.2014.2320819
URL : https://hal.archives-ouvertes.fr/hal-00906483

M. Kojima, S. Shindoh, and S. Hara, Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices, SIAM Journal on Optimization, vol.7, issue.1, pp.86-125, 1997.
DOI : 10.1137/S1052623494269035

J. B. Lasserre, 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

J. B. Lasserre, Convergent LMI relaxations for nonconvex quadratic programs Graduate seminar at MIT, fall, 2001.
DOI : 10.1109/cdc.2001.914738
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5707

J. B. Lasserre, Moments Positive Polynomials and Their Applications. Imperial College Press Optimization Series 1, p.28, 2010.
DOI : 10.1142/p665

J. B. Lasserre, An Introduction to Polynomial and Semi-Algebraic Optimization. Cambridge Texts in Applied Mathematics, p.28, 2015.
DOI : 10.1017/cbo9781107447226

C. Lin and R. Saigal, A predictor-corrector method for semi-definite linear programming, pp.48109-2117, 1995.

R. Madani, G. Fazelnia, and J. Lavaei, Rank-2 matrix solution for semidefinite relaxations of arbitrary polynomial optimization problems, p.43, 2014.

H. D. Mittelmann, The State-of-the-Art in Conic Optimization Software, of International Series in Operations Research & Management Science, chapter 23, 2012.
DOI : 10.1007/978-1-4614-0769-0_23

S. Mizuno, M. J. Todd, and Y. Ye, On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming, Mathematics of Operations Research, vol.18, issue.4, pp.964-981, 1993.
DOI : 10.1287/moor.18.4.964

Y. E. Nesterov and A. S. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics SIAM, vol.13, p.26, 1994.
DOI : 10.1137/1.9781611970791

Y. E. Nesterov and M. J. Todd, Self-Scaled Barriers and Interior-Point Methods for Convex Programming, Mathematics of Operations Research, vol.22, issue.1, pp.1-42, 1997.
DOI : 10.1287/moor.22.1.1

Y. E. Nesterov and M. J. Todd, Primal-Dual Interior-Point Methods for Self-Scaled Cones, SIAM Journal on Optimization, vol.8, issue.2, pp.324-364, 1998.
DOI : 10.1137/S1052623495290209

P. A. Parrilo, On a decomposition of multivariable forms via LMI methods, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334), p.28, 2000.
DOI : 10.1109/ACC.2000.878894

G. Pólya and G. Szegö, Problems and Theorems in Analysis II, p.30, 1976.
DOI : 10.1007/978-3-642-61905-2

F. Rendl, R. Sotirov, and H. Wolkowicz, A simplified/improved HKM direction for certain classes of semidefinite programming, 2002.

J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization, MPS-SIAM Series on Optimization 3. SIAM, p.26, 2001.
DOI : 10.1137/1.9780898718812

S. M. Robinson, Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems, SIAM Journal on Numerical Analysis, vol.13, issue.4, pp.497-513, 1976.
DOI : 10.1137/0713043

N. Z. Shor, Class of global minimum bounds of polynomial functions, English translation: Cybernetics, pp.9-11, 1987.
DOI : 10.1007/BF01070233

J. F. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optimization Methods and Software, pp.625-653, 1999.
DOI : 10.1080/10556789908805766

J. F. Sturm and S. Zhang, Symmetric primal-dual path-following algorithms for semidefinite programming, Applied Numerical Mathematics, vol.29, issue.3, pp.301-315, 1999.
DOI : 10.1016/S0168-9274(98)00099-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3516

M. J. Todd, K. Toh, and R. H. Tütüncü, On the Nesterov--Todd Direction in Semidefinite Programming, SIAM Journal on Optimization, vol.8, issue.3, pp.769-796, 1998.
DOI : 10.1137/S105262349630060X

K. Toh, M. J. Todd, and R. H. Tütüncü, On the Implementation and Usage of SDPT3 ??? A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research and Management Science 166, pp.715-754, 2012.
DOI : 10.1007/978-1-4614-0769-0_25

L. Vandenberghe and S. Boyd, Semidefinite Programming, SIAM Review, vol.38, issue.1, pp.49-95, 1996.
DOI : 10.1137/1038003

H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of Semidefinite Programming ? Theory, Algorithms, and Applications, of International Series in Operations Research & Management Science, 2000.

R. D. Zimmerman, C. E. Murillo-sánchez, and R. J. Thomas, MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education, IEEE Transactions on Power Systems, vol.26, issue.1, pp.12-19, 2011.
DOI : 10.1109/TPWRS.2010.2051168