Introduction to Global Optimization Exploiting Space-Filling Curves

DOI10.1007/978-1-4614-8042-6zbMath1278.90005OpenAlexW601427933MaRDI QIDQ2840349

Daniela Lera, Yaroslav D. Sergeyev, Roman G. Strongin

Publication date: 18 July 2013

Published in: SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-8042-6

zbMATH Keywords

global optimizationspace-filling curvereduction of dimensionalityPeano curveapproximation of Lipschitz constants

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Singular functions, Cantor functions, functions with other special properties (26A30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (74)

Deterministic sampling from uniform distributions with Sierpiński space-filling curves ⋮ Area-filling curves ⋮ A Search Algorithm for the Global Extremum of a Discontinuous Function ⋮ Best practices for comparing optimization algorithms ⋮ Always convergent methods for nonlinear equations of several variables ⋮ 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 ⋮ 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 \(\delta \)-Lipschitz framework ⋮ Iterative MC-algorithm to solve the global optimization problems ⋮ Generalized parallel computational schemes for time-consuming global optimization ⋮ 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 ⋮ Geodesic and contour optimization using conformal mapping ⋮ Lipschitz global optimization methods in control problems ⋮ Infinite numerical computing applied to Hilbert's, Peano's, and Moore's curves ⋮ Construction of Optimal Feedback for Zooplankton Diel Vertical Migration ⋮ Continuous global optimization on fractals through \(\alpha\)-dense curves ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems ⋮ An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria ⋮ Stabilization of Takagi-Sugeno models with non-measured premises: input-to-state stability approach ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area ⋮ Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ Utility/privacy trade-off as regularized optimal transport ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ 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 ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ Unnamed Item ⋮ On the theoretical analysis of the plant propagation algorithms ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ Visualization of a statistical approximation of the Pareto front ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization ⋮ A direct search algorithm for global optimization ⋮ Continuous global optimization through the generation of parametric curves ⋮ Globally-biased disimpl algorithm for expensive 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 ⋮ Filling holes using a mesh of filled curves ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ Efficient Neighbor Search for Particle Methods on GPUs ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ On a new smoothing technique for non-smooth, non-convex optimization ⋮ Approximating roots of nonlinear systems by \(\alpha\)-dense curves ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients ⋮ On an Asymptotic Property of a Simplicial Statistical Model of Global Optimization ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems

This page was built for publication: Introduction to Global Optimization Exploiting Space-Filling Curves