Introduction to global optimization exploiting space-filling curves
approximation of Lipschitz constantsglobal optimizationPeano curvereduction of dimensionalityspace-filling curve
Singular functions, Cantor functions, functions with other special properties (26A30) Numerical optimization and variational techniques (65K10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Applications of mathematical programming (90C90)
- Lipschitz and Hölder global optimization using space-filling curves
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization with space-filling curves.
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves
- Optimal maximization and approximation algorithms for approximately calculated functions of many variables
- Best practices for comparing optimization algorithms
- Always convergent methods for nonlinear equations of several variables
- Generalized parallel computational schemes for time-consuming global optimization
- Geodesic and contour optimization using conformal mapping
- Stabilization of Takagi-Sugeno models with non-measured premises: input-to-state stability approach
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- On the theoretical analysis of the plant propagation algorithms
- Visualization of a statistical approximation of the Pareto front
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- A direct search algorithm for global optimization
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Efficient multicriterial optimization based on intensive reuse of search information
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Global optimization with space-filling curves.
- Filling holes using a mesh of filled curves
- A deterministic method for continuous global optimization using a dense curve
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Sequential model based optimization of partially defined functions under unknown constraints
- A \textsc{direct}-type global optimization algorithm for image registration
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems
- Novel global optimization algorithm with a space-filling curve and integral function
- On a new smoothing technique for non-smooth, non-convex optimization
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Deterministic sampling from uniform distributions with Sierpiński space-filling curves
- Area-filling curves
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework
- Infinite numerical computing applied to Hilbert's, Peano's, and Moore's curves
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- Globally-biased disimpl algorithm for expensive global optimization
- Approximating roots of nonlinear systems by \(\alpha\)-dense curves
- Iterative MC-algorithm to solve the global optimization problems
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Optimization by space-densifying curves as a natural generalization of the Alienor method.
- On the least-squares fitting of data by sinusoids
- A class of smooth modification of space-filling curves for global optimization problems
- Parallel global optimization on GPU
- On numerical solving the spherical separability problem
- Adaptive nested optimization scheme for multidimensional global search
- Test problem generator for unconstrained global optimization
- Lipschitz global optimization methods in control problems
- scientific article; zbMATH DE number 2047430 (Why is no real title available?)
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- On a global optimization algorithm for bivariate smooth functions
- A Search Algorithm for the Global Extremum of a Discontinuous Function
- Stability Analysis of DESA Optimization Algorithm
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme
- On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- Generating -dense curves in non-convex sets to solve a class of non-smooth constrained global optimization
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- On an asymptotic property of a simplicial statistical model of global optimization
- Efficient neighbor search for particle methods on GPUs
- Multidimensional global optimization using numerical estimates of objective function derivatives
- Performance of convex underestimators in a branch-and-bound framework
- Branch and probability bound methods in multi-objective optimization
- On computational search for Nash equilibrium in hexamatrix games
- Construction of Optimal Feedback for Zooplankton Diel Vertical Migration
- Continuous global optimization on fractals through \(\alpha\)-dense curves
- Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
- Global optimization method of multivariate non-Lipschitz functions using tangent minorants
- An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
- A new partition method for DIRECT-type algorithm based on minimax design
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- Utility/privacy trade-off as regularized optimal transport
- Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
- A numerical method to approximate the solutions of nonlinear systems in densifiable sets
- Continuous global optimization through the generation of parametric curves
- Comparative efficiency of machine learning models for enhancing algorithms in solving multiextremal multicriteria problems
- A new global optimization algorithm based on space-filling curve and auxiliary function approach and its applications
- A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption
- An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Lipschitz modulus of convex functions via function values
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- A deterministic global optimization using smooth diagonal auxiliary functions
- Lipschitz and Hölder global optimization using space-filling curves
This page was built for publication: Introduction to global optimization exploiting space-filling curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840349)