Uniform tree approximation by global optimization techniques
type: Item
instance of: scholarly article
title: Uniform tree approximation by global optimization techniques
zbMATH Open document ID: 1225.41006
author: Bernardo Llanas
author: Francisco Javier Sáinz
published in: Computing and Visualization in Science
publication date: 2010-11-03T00:00:00Z
review text: 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.
reviewed by: Daniel Wulbert
Mathematics Subject Classification ID: 41A45
zbMATH DE Number: 5809696
zbMATH Keywords: tree approximation
zbMATH Keywords: uniform approximation
zbMATH Keywords: D.C. optimization
zbMATH Keywords: piecewise affine functions
zbMATH Keywords: d-simplex
describes a project that uses: Global Optimization Toolbox For Maple
MaRDI profile type: Publication
full work available at URL: s00791-009-0126-4
OpenAlex ID: W1991612213
cites work: Q4023852
cites work: Fast computation in adaptive tree approximation
cites work: PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
cites work: Lower bounds for simplicial covers and triangulations of cubes
cites work: Q4779803
cites work: Optimization and nonsmooth analysis
cites work: Adaptive approximation by multivariate smooth splines
cites work: An adaptive algorithm for multivariate approximation giving optimal convergence rates
cites work: Degree of Adaptive Approximation
cites work: Q4269112
cites work: A Local Convergence Proof for the Minvar Algorithm for Computing Continuous Piecewise Linear Approximations
cites work: Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
cites work: Q3141900
cites work: Introduction to global optimization
cites work: Robot navigation functions on manifolds with boundary
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
cites work: Efficient computation of the Hausdorff distance between polytopes by exterior random covering
cites work: Asymptotically efficient triangulations of the \(d\)-cube
cites work: Extended univariate algorithms for \(n\)-dimensional global optimization
cites work: Legged robots
cites work: The Construction of Analytic Diffeomorphisms for Exact Robot Navigation on Star Worlds
cites work: Error of the approximation by interpolation polynomials of small degrees on n-simplices
cites work: Q4833805
cites work: The Error in Linear Interpolation at the Vertices of a Simplex
DOI: 10.1007/S00791-009-0126-4
Recommended article: Global Numerical Constraints on Trees
Recommended article: Q4381299
Recommended article: Tree approximation and optimal encoding
Recommended article: On finding most uniform spanning trees
Recommended article: Near best tree approximation
Recommended article: Q4234181
Recommended article: Approximating Optimal Binary Decision Trees
Recommended article: Approximating optimal binary decision trees
description: scientific article; zbMATH DE number 5809696