IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v136y2008i3d10.1007_s10957-007-9315-9.html
   My bibliography  Save this article

Gradient Estimation Using Lagrange Interpolation Polynomials

Author

Listed:
  • R. C. M. Brekelmans

    (Tilburg University)

  • L. T. Driessen

    (Philips Lightening)

  • H. J. M. Hamers

    (Tilburg University)

  • D. Hertog

    (Tilburg University)

Abstract

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, which can be split up into a deterministic error 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+\frac{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. We provide also an optimal division between the number of gridpoints and replicates in case the number of evaluations is fixed. Further, it is shown that the estimation of the derivatives is more robust when the number of evaluation points is increased. Finally, test results show the practical use of the proposed method.

Suggested Citation

  • R. C. M. Brekelmans & L. T. Driessen & H. J. M. Hamers & D. Hertog, 2008. "Gradient Estimation Using Lagrange Interpolation Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 341-357, March.
    • Handle: RePEc:spr:joptap:v:136:y:2008:i:3:d:10.1007_s10957-007-9315-9
    DOI: 10.1007/s10957-007-9315-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-007-9315-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-007-9315-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. R. C. M. Brekelmans & L. T. Driessen & H. J. M. Hamers & D. den. Hertog, 2005. "Gradient Estimation Schemes for Noisy Functions," Journal of Optimization Theory and Applications, Springer, vol. 126(3), pages 529-551, September.
    2. Pierre L'Ecuyer & Gaétan Perron, 1994. "On the Convergence Rates of IPA and FDC Derivative Estimators," Operations Research, INFORMS, vol. 42(4), pages 643-656, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Boyle, Phelim & Broadie, Mark & Glasserman, Paul, 1997. "Monte Carlo methods for security pricing," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1267-1321, June.
    2. Pierre L’Ecuyer & Florian Puchhammer & Amal Ben Abdellah, 2022. "Monte Carlo and Quasi–Monte Carlo Density Estimation via Conditioning," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1729-1748, May.
    3. Benhamou, Eric, 2000. "A generalisation of Malliavin weighted scheme for fast computation of the Greeks," LSE Research Online Documents on Economics 119105, London School of Economics and Political Science, LSE Library.
    4. Montero, Miquel & Kohatsu-Higa, Arturo, 2003. "Malliavin Calculus applied to finance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 320(C), pages 548-570.
    5. Sidney Yakowitz & Pierre L'Ecuyer & Felisa Vázquez-Abad, 2000. "Global Stochastic Optimization with Low-Dispersion Point Sets," Operations Research, INFORMS, vol. 48(6), pages 939-950, December.
    6. Angun, M.E., 2004. "Black box simulation optimization : Generalized response surface methodology," Other publications TiSEM 2548e953-54ce-44e2-8c5b-7, Tilburg University, School of Economics and Management.
    7. Hendrik Kohrs & Hermann Mühlichen & Benjamin R. Auer & Frank Schuhmacher, 2019. "Pricing and risk of swing contracts in natural gas markets," Review of Derivatives Research, Springer, vol. 22(1), pages 77-167, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:136:y:2008:i:3:d:10.1007_s10957-007-9315-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.