Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds.

DOI10.1016/S0305-0548(02)00082-5zbMath1035.94007OpenAlexW1983332720MaRDI QIDQ1422350

Birna P. Kristinsdottir, Zelda B. Zabinsky, Robert L. Smith

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00082-5

zbMATH Keywords

InterpolationLipschitz functionsFunction estimationSampling strategy

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20)

Related Items (9)

DIRECT algorithm: A new definition of potentially optimal hyperrectangles ⋮ Robust learning-based MPC for nonlinear constrained systems ⋮ Lazily adapted constant kinky inference for nonparametric regression and model-reference adaptive control ⋮ Online learning with stability guarantees: a memory-based warm starting for real-time MPC ⋮ Optimally adaptive integration of univariate Lipschitz functions ⋮ NSM constrained approximation of Lipschitz functions from data ⋮ Interpolation of Lipschitz functions ⋮ Lipschitz continuity results for a class of variational inequalities and applications: A geometric approach ⋮ Global Approximation of Solutions of Time-Dependent Variational Inequalities

Uses Software

• UNCMND
• FITPACK
• pchip

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shape-preserving quasi-interpolation and interpolation by box spline surfaces
• On Timonov's algorithm for global optimization of univariate Lipschitz functions
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• Shape preserving approximations by polynomials and splines
• Learning lipschitz functions

This page was built for publication: Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds.