Globally-biased disimpl algorithm for expensive global optimization
From MaRDI portal
Publication:2250095
DOI10.1007/s10898-014-0180-4zbMath1297.90130OpenAlexW2091785502MaRDI QIDQ2250095
Julius Žilinskas, Remigijus Paulavičius, Yaroslav D. Sergeyev, Dmitri E. Kvasov
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0180-4
global optimizationLipschitz conditiontwo-phase approach\textsc{Direct} algorithmglobally-biased \textsc{Disimpl} algorithm
Related Items (51)
Best practices for comparing optimization algorithms ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ 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 ⋮ Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems ⋮ 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 ⋮ A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods ⋮ A Partition Based Bayesian Multi-objective Optimization Algorithm ⋮ Book review of: R. Paulavičius and J. Žilinskas: Simplicial global optimization ⋮ Visualization of a statistical approximation of the Pareto front ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ On modeling and global solutions for d.c. optimization problems by canonical duality theory ⋮ A direct search algorithm for global optimization ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ Improving the convergence rate of the DIRECT global optimization algorithm ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ The DIRECT algorithm: 25 years later ⋮ 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 ⋮ SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems ⋮ A multi-objective \textbf{DIRECT} algorithm for ship hull optimization ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ A derivative-free optimization approach for the autotuning of a forex trading strategy ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ A modified quasisecant method for global optimization ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ 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 ⋮ SMGO: a set membership approach to data-driven global optimization ⋮ MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Lipschitz global optimization methods in control problems
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Univariate geometric Lipschitz global optimization algorithms
- On determining the cover of a simplex by spheres centered at its vertices
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- Additive scaling and the \texttt{DIRECT} algorithm
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Lipschitz and Hölder global optimization using space-filling curves
- Incorporating minimum Frobenius norm models in direct search
- A univariate global search working with a set of Lipschitz constants for the first derivative
- The computation of fixed points and applications
- Global one-dimensional optimization using smooth auxiliary functions
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Local tuning and partition strategies for diagonal GO methods
- Global optimization based on a statistical model and simplicial partitioning.
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Handbook of global optimization. Vol. 2
- Dynamic data structures for a direct search algorithm
- A comparison of global optimization methods for the design of a high-speed civil transport
- Algorithms for noisy problems in gas transmission pipeline optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A deterministic approach to global box-constrained optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Linear scaling and the DIRECT algorithm
- A hybrid global optimization algorithm for nonlinear least squares regression
- Stochastic global optimization.
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Homogeneous algorithms for multiextremal optimization
- Encyclopedia of Optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- An Information Global Optimization Algorithm with Local Tuning
- Benchmarking Derivative-Free Optimization Algorithms
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Benchmarking optimization software with performance profiles.
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
This page was built for publication: Globally-biased disimpl algorithm for expensive global optimization
