]. F. Bibliographie and . Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM Journal on Optimization, vol.5, issue.1, pp.13-51, 1993.

F. Alizadeh, J. A. Haeberly, and M. L. Overton, Complementarity and nondegeneracy in semidefinite programming, Mathematical Programming, pp.111-128, 1997.
DOI : 10.1007/BF02614432

K. M. Anstreicher, Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming, Journal of Global Optimization, vol.84, issue.12, pp.471-484, 2009.
DOI : 10.1007/s10898-008-9372-0

A. Barvinok, Problems of distance geometry and convex properties of quadratic maps, Discrete & Computational Geometry, vol.134, issue.2, pp.189-202, 1995.
DOI : 10.1007/BF02574037

A. Ben-israel, A. Charnes, and K. Kortanek, Duality and asymptotic solvability over cones, Bulletin of the American Mathematical Society, vol.75, issue.2, pp.318-324, 1969.
DOI : 10.1090/S0002-9904-1969-12153-1

S. J. Benson, Y. Ye, and X. Zhang, Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization, SIAM Journal on Optimization, vol.10, issue.2, pp.443-461, 2000.
DOI : 10.1137/S1052623497328008

D. Bertsimas and I. Popescu, On the Relation Between Option and Stock Prices: A Convex Optimization Approach, Operations Research, vol.50, issue.2, pp.358-374, 2002.
DOI : 10.1287/opre.50.2.358.424

D. Bertsimas and I. Popescu, Optimal Inequalities in Probability Theory: A Convex Optimization Approach, SIAM Journal on Optimization, vol.15, issue.3, pp.780-804, 2005.
DOI : 10.1137/S1052623401399903

B. Borchers, CSDP, a C library for semidefinite programming. Optimization Methods and Software, 1999.

G. Calafiore and L. Ghaoui, On Distributionally Robust Chance-Constrained Linear Programs, Journal of Optimization Theory and Applications, vol.58, issue.1, pp.1-22, 2006.
DOI : 10.1007/s10957-006-9084-x

M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1115-1145, 1995.
DOI : 10.1145/227683.227684

L. S. Grötschel, . Martin, and . Lovász, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-197, 1981.
DOI : 10.1007/BF02579273

C. H. Habilitationsschrift and T. Berlin, Semidefinite programming for combinatorial optimization, 2000.

C. Helmberg and F. , A Spectral Bundle Method for Semidefinite Programming, SIAM Journal on Optimization, vol.10, issue.3, pp.673-696, 2000.
DOI : 10.1137/S1052623497328987

M. Kocvara and M. Stingl, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, Mathematical Programming, Series B, vol.109, pp.2-3413, 2007.

J. Lasserre, A semidefinite programming approach to the generalized problem of moments, Mathematical Programming, vol.17, issue.1, pp.65-92, 2008.
DOI : 10.1007/s10107-006-0085-1

M. Laurent and F. , Handbook on Discrete Optimization, chapter Semidefinite Programming and Integer Programming, pp.393-514, 2005.

C. Lemaréchal and F. Oustry, Semidefinite relaxations and lagrangian duality with application to combinatorial optimization, 1999.

L. Lovász, On the Shannon capacity of a graph, IEEE Transactions on Information Theory, vol.25, issue.1, pp.1-7, 1979.
DOI : 10.1109/TIT.1979.1055985

Y. Nesterov and A. Nemirovski, Interior-point polynomial methods in convex programming, 1994.

G. Pataki, On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues, Mathematics of Operations Research, vol.23, issue.2, 1998.
DOI : 10.1287/moor.23.2.339

I. Polik and T. Terlaky, A Survey of the S-Lemma, SIAM Review, vol.49, issue.3, pp.371-418, 2007.
DOI : 10.1137/S003614450444614X

S. Poljak, F. Rendl, and H. Wolkowicz, A recipe for semidefinite relaxation for (0,1)-quadratic programming, Journal of Global Optimization, vol.40, issue.2, pp.51-73, 1995.
DOI : 10.1007/BF01100205

F. Roupin, From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems, Journal of Combinatorial Optimization, vol.8, issue.4, pp.469-493, 2004.
DOI : 10.1007/s10878-004-4838-6

URL : https://hal.archives-ouvertes.fr/hal-00596181

H. D. Sherali and W. P. Adams, A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.411-430, 1990.
DOI : 10.1137/0403036

N. Shor, Quadratic optimization problems, Soviet Journal of computer Systems Sciences, vol.25, pp.1-11, 1987.

L. Vandenberghe, S. Boyd, and K. Comanor, Generalized Chebyshev Bounds via Semidefinite Programming, SIAM Review, vol.49, issue.1, pp.52-64, 2007.
DOI : 10.1137/S0036144504440543

R. Zorgati, W. Van-ackooij, and A. Gorge, Uncertainties on Power Systems. Probabilistic approach and conic approximation, 2010 IEEE 11th International Conference on Probabilistic Methods Applied to Power Systems, 2010.
DOI : 10.1109/PMAPS.2010.5528322

S. Zymler, D. Kuhn, and B. Rustem, Distributionnally robust joint chance constraint with secondorder moment information, Mathematical Programming, 2011.