Uniform tree approximation by global optimization techniques
From MaRDI portal
Let \(f\) be a convex (or a Lipschitz) function of \(d\) variables. The authors present procedures for approximation \(f\) by uniformly continuous, piecewise affine functions, and they present an algorithm for finding tight upper-bounds for the error. The procedure produces approximations that converge uniformly. As examples the authors offer numerical experiments using as the target function, \(f\), the distance from a point to a geometric figure.
Recommendations
- Global numerical constraints on trees
- scientific article; zbMATH DE number 1135820
- Tree approximation and optimal encoding
- On finding most uniform spanning trees
- Near best tree approximation
- scientific article; zbMATH DE number 1263307
- Approximating Optimal Binary Decision Trees
- Approximating optimal binary decision trees
Cites work
- A Local Convergence Proof for the Minvar Algorithm for Computing Continuous Piecewise Linear Approximations
- Adaptive approximation by multivariate smooth splines
- An adaptive algorithm for multivariate approximation giving optimal convergence rates
- An Automatic Method of Solving Discrete Programming Problems
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- Asymptotically efficient triangulations of the d-cube
- Degree of Adaptive Approximation
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- Error of the approximation by interpolation polynomials of small degrees on n-simplices
- Extended univariate algorithms for n-dimensional global optimization
- Fast computation in adaptive tree approximation
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 108394 (Why is no real title available?)
- scientific article; zbMATH DE number 1354819 (Why is no real title available?)
- scientific article; zbMATH DE number 1820666 (Why is no real title available?)
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- Introduction to global optimization
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Legged robots
- Lower bounds for simplicial covers and triangulations of cubes
- Optimization and nonsmooth analysis
- PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
- Robot navigation functions on manifolds with boundary
- The Construction of Analytic Diffeomorphisms for Exact Robot Navigation on Star Worlds
- The Error in Linear Interpolation at the Vertices of a Simplex
Cited in
(5)- Approximation in p-norm of univariate concave functions
- A tree labeling problem with an application to optimal approximation of continuous functions
- scientific article; zbMATH DE number 3956307 (Why is no real title available?)
- On min-max affine approximants of convex or concave real-valued functions from \(\mathbb{R}^k\), Chebyshev equioscillation and graphics
- scientific article; zbMATH DE number 2208556 (Why is no real title available?)
This page was built for publication: Uniform tree approximation by global optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600944)
