Optimally adaptive integration of univariate Lipschitz functions
From MaRDI portal
Publication:2480911
DOI10.1007/S00453-007-9093-7zbMATH Open1147.65021OpenAlexW2090395050MaRDI QIDQ2480911FDOQ2480911
Authors: Ilya Baran, Erik D. Demaine, Dmitriy Katz 
Publication date: 3 April 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9093-7
Recommendations
Monte Carlo methods (65C05) Numerical quadrature and cubature formulas (65D32) Approximate quadratures (41A55)
Cites Work
- A Remark on Stirling's Formula
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for finding the absolute extremum of a function
- Optimal aggregation algorithms for middleware.
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds.
- Finding hidden independent sets in interval graphs
- A modified Monte Carlo integration.
- OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE
Cited In (6)
- Solvable integration problems and optimal sample size selection
- Estimating the average of a Lipschitz-continuous function from one sample
- Optimally Adaptive Integration of Univariate Lipschitz Functions
- Lipschitz continuity results for a class of variational inequalities and applications: A geometric approach
- Title not available (Why is that?)
- Global approximation of solutions of time-dependent variational inequalities
This page was built for publication: Optimally adaptive integration of univariate Lipschitz functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480911)
