L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, 2012.
DOI : 10.1007/978-1-4612-0701-6

B. Bank, M. Giusti, J. Heintz, and L. Pardo, Generalized polar varieties: geometry and algorithms, Journal of complexity, vol.21, issue.4, p.377412, 2005.
DOI : 10.1016/j.jco.2004.10.001

URL : https://doi.org/10.1016/j.jco.2004.10.001

S. Boyd, S. Kim, L. Vandenberghe, and A. Hassibi, A tutorial on geometric programming, Optim. Eng, vol.8, issue.1, p.67127, 2007.
DOI : 10.1007/s11081-007-9001-7

S. Basu, R. Pollack, and M. Roy, A new algorithm to nd a point in every cell dened by a family of polynomials. In Quantier elimination and cylindrical algebraic decomposition, 1998.

S. Boyd and L. Vandenberghe, Convex optimization, 2004.

S. Chevillard, J. Harrison, M. Joldes, and C. Lauter, Ecient and accurate computation of upper bounds of approximation errors, Theoretical Computer Science, vol.412, issue.16, pp.1523-1543, 2011.

G. E. Collins, Quantier elimination for real closed elds by cylindrical algebraic decompostion, ATFL 2nd GI Conf. Kaiserslautern, p.134183, 1975.
DOI : 10.1007/3-540-07407-4_17

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-07407-4_17.pdf

V. Chandrasekaran and P. Shah, Relative Entropy Relaxations for Signomial Optimization
DOI : 10.1137/140988978

URL : http://arxiv.org/pdf/1409.7640