#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1971

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Richard Leroy
- Reliable Computing
- 2012

In this article, we address the question of minimizing a real polynomial over the standard simplex. This problem can be solved with a branch-andbound method, using the Bernstein form of the polynomial. Such methods have been widely studied from a numerical point of view, and refinements have been proposed to speed up the computational time. We are here… (More)

- Saugata Basu, Richard Leroy, Marie-Françoise Roy
- ArXiv
- 2009

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P ∈ Z [X1, . . . , Xk] over the standard simplex ∆ ⊂ R, assuming that m > 0. Recent algorithmic developments in real algebraic geometry enable us to obtain a positive lower bound on m in terms of the dimension k, the degree d and the bitsize τ of the coefficients of P… (More)

- Richard Leroy
- 2008

- Lawrence Durrell, Richard Leroy, Lawrence Durrell, RICHARD KING J .EROY, John C. Boggs
- 2014

- Richard Leroy
- Revue odonto-implantologique
- 1971

- ‹
- 1
- ›