Interpolation of Lipschitz functions

[1]  A. H. Thiessen.  PRECIPITATION AVERAGES FOR LARGE AREAS , 1911 .

[2]  Michael Golomb,et al.  OPTIMAL APPROXIMATIONS AND ERROR BOUNDS , 1958 .

[3]  Rudolph E. Langer,et al.  On Numerical Approximation , 1959 .

[4]  N. S. Bakhvalov,et al.  On the optimality of linear methods for operator approximation in convex classes of functions , 1971 .

[5]  B. Shubert.  A Sequential Method Seeking the Global Maximum of a Function , 1972 .

[6]  S. A. Piyavskii.  An algorithm for finding the absolute extremum of a function , 1972 .

[7]  A. G. Sukharev.  Optimal search for the roots of a function satisfying a lipschitz condition , 1976 .

[8]  T. J. Rivlin,et al.  The optimal recovery of smooth functions , 1976 .

[9]  Charles A. Micchelli,et al.  A Survey of Optimal Recovery , 1977 .

[10]  T. J. Rivlin,et al.  Optimal Estimation in Approximation Theory , 1977 .

[11]  C. D. Boor.  Computational Aspects of Optimal Recovery. , 1977 .

[12]  A. G. Sukharev.  Optimal method of constructing best uniform approximations for functions of a certain class , 1978 .

[13]  Henryk Wozniakowski,et al.  A general theory of optimal algorithms , 1980, ACM monograph series.

[14]  R. Sibson,et al.  A brief description of natural neighbor interpolation , 1981 .

[15]  A. D. Gordon,et al.  Interpreting multivariate data , 1982 .

[16]  P. McMullen.  Convex Sets and Their Applications , 1982 .

[17]  T. J. Rivlin,et al.  Lectures on optimal recovery , 1985 .

[18]  Christopher A. Sikorski.  Optimal solution of nonlinear equations , 1985, J. Complex..

[19]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[20]  Aleksei G. Sukharev.  On the existence of optimal affine methods for approximating linear functionals , 1986, J. Complex..

[21]  P. Alfeld.  Scattered data interpolation in three or more variables , 1989 .

[22]  Tom Lyche,et al.  Mathematical methods in computer aided geometric design , 1989 .

[23]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[24]  Aleksei G. Sukharev,et al.  Minimax Models in the Theory of Numerical Methods , 1992 .

[25]  V. F. Demʹi︠a︡nov,et al.  Constructive nonsmooth analysis , 1995 .

[26]  Mariette Yvinec,et al.  Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions , 1995, SCG '95.

[27]  Duane A. Cooper.  Learning lipschitz functions , 1995, Int. J. Comput. Math..

[28]  B. P. Zhang,et al.  Estimation of the Lipschitz constant of a function , 1996, J. Glob. Optim..

[29]  Paul Dierckx,et al.  Curve and surface fitting with splines , 1994, Monographs on numerical analysis.

[30]  V. D. Ivanov,et al.  The non-Sibsonian interpolation : A new method of interpolation of the values of a function on an arbitrary set of points , 1997 .

[31]  G. Milovanović,et al.  Shape Preserving Approximations by Polynomials and Splines , 1997 .

[32]  Boris I. Kvasov,et al.  Methods of Shape-Preserving Spline Approximation , 2000 .

[33]  Y. D. Sergeyev,et al.  Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications) , 2000 .

[34]  G. Beliakov.  Shape preserving approximation using least squares splines , 2000, Analysis in Theory and Applications.

[35]  W. Godwin.  Article in Press , 2000 .

[36]  Lynn Margaret Batten,et al.  Fast Algorithm for the Cutting Angle Method of Global Optimization , 2002, J. Glob. Optim..

[37]  Robert L. Smith,et al.  Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds , 2003, Comput. Oper. Res..

[38]  Gleb Beliakov,et al.  How to build aggregation operators from data , 2003, Int. J. Intell. Syst..

[39]  Eric R. Ziegel,et al.  The Elements of Statistical Learning , 2003, Technometrics.

[40]  Gleb Beliakov,et al.  Geometry and combinatorics of the cutting angle method , 2003 .

[41]  R. Kannan,et al.  Convex Sets and their Applications , 2006 .