In this paper we use Lagrange interpolation polynomials to obtain good gradient estimations.This is e.g. important for nonlinear programming solvers.As an error criterion we take the mean squared error.This error can be split up into a deterministic and a stochastic error.We analyze these errors using (N times replicated) Lagrange interpolation polynomials.We show that the mean squared error is of order N-1+ 1 2d if we replicate the Lagrange estimation procedure N times and use 2d evaluations in each replicate.As a result the order of the mean squared error converges to N-1 if the number of evaluation points increases to infinity.Moreover, we show that our approach is also useful for deterministic functions in which numerical errors are involved.Finally, we consider the case of a fixed budget of evaluations.For this situation we provide an optimal division between the number of replicates and the number of evaluations in a replicate.
|Place of Publication||Tilburg|
|Number of pages||18|
|Publication status||Published - 2003|
|Name||CentER Discussion Paper|
- non linear programming
Hamers, H. J. M., Brekelmans, R. C. M., Driessen, L., & den Hertog, D. (2003). Gradient Estimation using Lagrange Interpolation Polynomials. (CentER Discussion Paper; Vol. 2003-101). Operations research.