Improving the convergence rate of the DIRECT global optimization algorithm
From MaRDI portal
Publication:522279
Recommendations
- Convergence rates of efficient global optimization algorithms
- Convergence rates of a global optimization algorithm
- Improved global convergence probability using multiple independent optimizations
- An improved conjugate gradient method and its global convergence
- On the investigation of the practical convergence of an algorithm of global optimization
- Improving Convergence Rates of a Class of Algorithms
- The convergence speed of interval methods for global optimization
- An improved descent conjugate gradient method and its convergence
- scientific article; zbMATH DE number 4166732
- scientific article; zbMATH DE number 4183191
Cites work
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A locally-biased form of the DIRECT algorithm.
- A modified DIRECT algorithm with bilevel partition
- A partition-based global optimization algorithm
- A review of recent advances in global optimization
- Additive scaling and the \texttt{DIRECT} algorithm
- Algorithm 829
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Dynamic data structures for a direct search algorithm
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization by multilevel coordinate search
- Global optimization by multilevel partition
- Global optimization using the DIRECT algorithm in Matlab
- Globally-biased disimpl algorithm for expensive global optimization
- Homogeneous algorithms for multiextremal optimization
- Linear scaling and the DIRECT algorithm
- Lipschitzian optimization without the Lipschitz constant
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Optimization by simulated annealing
- Test functions with variable attraction regions for global optimization problems
Cited in
(12)- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Modified DIRECT Algorithm for Scaled Global Optimization Problems
- A new partition method for DIRECT-type algorithm based on minimax design
- Convergence rates of a global optimization algorithm
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- The DIRECT algorithm: 25 years later
- Adaptive block coordinate DIRECT algorithm
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Additive scaling and the \texttt{DIRECT} algorithm
- A new reliable operating region design method
This page was built for publication: Improving the convergence rate of the DIRECT global optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522279)
