Uniform tree approximation by global optimization techniques
From MaRDI portal
Publication:600944
DOI10.1007/s00791-009-0126-4zbMath1225.41006OpenAlexW1991612213MaRDI QIDQ600944
Bernardo Llanas, Francisco Javier Sáinz
Publication date: 3 November 2010
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00791-009-0126-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robot navigation functions on manifolds with boundary
- Error of the approximation by interpolation polynomials of small degrees on n-simplices
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Adaptive approximation by multivariate smooth splines
- An adaptive algorithm for multivariate approximation giving optimal convergence rates
- Asymptotically efficient triangulations of the \(d\)-cube
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- Fast computation in adaptive tree approximation
- Introduction to global optimization
- Lower bounds for simplicial covers and triangulations of cubes
- Degree of Adaptive Approximation
- An Automatic Method of Solving Discrete Programming Problems
- Legged robots
- Optimization and nonsmooth analysis
- The Construction of Analytic Diffeomorphisms for Exact Robot Navigation on Star Worlds
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- The Error in Linear Interpolation at the Vertices of a Simplex
- A Local Convergence Proof for the Minvar Algorithm for Computing Continuous Piecewise Linear Approximations
- PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
This page was built for publication: Uniform tree approximation by global optimization techniques
