On the minimum of a positive polynomial over the standard simplex

Journal of Symbolic Computation

Volumn 45, Issue 4, 2010, Pages 434-442

  Jeronimo, Gabriela ^a,b   Perrucci, Daniel ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

Author keywords

Optimization on polyhedra; Positivity of polynomials

Indexed keywords

EID: 76749145005     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2010.01.001     Document Type: Article

References (15)

1. Basu, S., Leroy, R., Roy, M.-F., 2009. A bound on the minimum of a real positive polynomial over the standard simplex, Manuscript. Available at: arXiv:0902.3304.
2. Basu S., Pollack R., and Roy M.-F. Algorithms in Real Algebraic Geometry. 2nd. ed. Algorithms and Computation in Mathematics vol. 10 (2006), Springer-Verlag, Berlin
3. Bochnak J., Coste M., and Roy M.F. Géométrie algébrique réelle. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) vol. 12 (1987), Springer-Verlag, Berlin
4. Canny J. The Complexity of Robot Motion Planning (1987), MIT press
5. de Loera J., and Santos F. An effective version of Pólya's theorem on positive definite forms. J. Pure Appl. Algebra 108 3 (1996) 231-240
6. Emiris, I., Mourrain, B., Tsigaridas, E., 2009. The DMM bound: Multivariate (aggregate) separation bounds, Manuscript.
7. González-Vega L., and Trujillo F. Using symmetric functions to describe the solution set of a zero dimensional ideal. Applied Algebra, Algebraic Algorithms and Error-correcting Codes. Paris, 1995. Lecture Notes in Comput. Sci. vol. 948 (1995), Springer, Berlin 232-247
8. Jeronimo, G., Perrucci, D., Sabia, J., On sign conditions over real multivariate polynomials. Discrete Comput. Geom, in press (doi:10.1007/s00454-009-9200-4).
9. Leroy, R., 2008. Certificats de positivité et minimisation polynomiale dans la base de Bernstein multivariée. Ph.D. Thesis, Université de Rennes 1.
10. Mignotte M., and Stefanescu D. Polynomials. An Algorithmic Approach. Springer Series in Discrete Mathematics and Theoretical Computer Science (1999), Springer-Verlag Singapore, Singapore Centre for Discrete Math. & Theoret. Comput. Sci., Auckland
11. Powers V., and Reznick B. A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. Effective methods in algebraic geometry (Bath, 2000). J. Pure Appl. Algebra 164 1-2 (2001) 221-229
12. Prestel A., and Delzell C. Positive Polynomials. From Hilbert's 17th Problem to Real Algebra. Springer Monographs in Mathematics (2001), Springer-Verlag, Berlin
13. Rouillier F. Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Eng. Commun. Comput. 9 5 (1999) 433-461
14. Schweighofer M. On the complexity of Schmüdgen's positivstellensatz. J. Complexity 20 4 (2004) 529-543
15. Solernó P. Effective Łojasiewicz inequalities in semialgebraic geometry. Appl. Algebra Engrg. Comm. Comput. 2 1 (1991) 2-14