Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
From MaRDI portal
Publication:2660836
DOI10.1016/j.amc.2020.125660OpenAlexW3084492764MaRDI QIDQ2660836
Daniela Lera, Yaroslav D. Sergeyev, Mikhail A. Posypkin
Publication date: 31 March 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125660
global optimizationderivative-free methodssystems of nonlinear inequalitiesspace-filling curvesrobot workspace
Related Items (4)
Modelling human active search in optimizing black-box functions ⋮ Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ Preface to the virtual special issue recent developments in applied mathematics and computation ⋮ Nowhere differentiability conditions on composites of Peano curves
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Adaptive nested optimization scheme for multidimensional global search
- Lipschitz global optimization methods in control problems
- A filter algorithm for nonlinear systems of equalities and inequalities
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
- A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities
- Space-filling curves
- Global optimization: Fractal approach and non-redundant parallelism
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Approximating a solution set of nonlinear inequalities
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- Globally-biased disimpl algorithm for expensive global optimization
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Stochastic global optimization.
- A global minimization algorithm for Lipschitz functions
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- The modified method of refined bounds for polyhedral approximation of convex polytopes
- On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Space filling curves and mathematical programming
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
This page was built for publication: Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
