Improving the convergence rate of the DIRECT global optimization algorithm
From MaRDI portal
Publication:522279
DOI10.1007/S10898-016-0447-ZzbMATH Open1370.90193OpenAlexW2512753808MaRDI QIDQ522279FDOQ522279
Authors: Qunfeng Liu, Guang Yang, Zhongzhi Zhang, Jinping Zeng 
Publication date: 28 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0447-z
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
- scientific article; zbMATH DE number 4183191
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Algorithm 829
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Optimization by simulated annealing
- Benchmarking optimization software with performance profiles.
- Global optimization using the DIRECT algorithm in Matlab
- A locally-biased form of the DIRECT algorithm.
- Lipschitzian optimization without the Lipschitz constant
- A review of recent advances in global optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Global optimization by multilevel coordinate search
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Test functions with variable attraction regions for global optimization problems
- Globally-biased disimpl algorithm for expensive global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Additive scaling and the \texttt{DIRECT} algorithm
- Dynamic data structures for a direct search algorithm
- A partition-based global optimization algorithm
- Homogeneous algorithms for multiextremal optimization
- Linear scaling and the DIRECT algorithm
- A modified DIRECT algorithm with bilevel partition
- Global optimization by multilevel partition
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
Cited In (9)
- Additive scaling and the \texttt{DIRECT} algorithm
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Convergence rates of a global optimization algorithm
- The DIRECT algorithm: 25 years later
- Modified DIRECT Algorithm for Scaled Global Optimization Problems
- A new partition method for DIRECT-type algorithm based on minimax design
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- A new reliable operating region design method
Uses Software
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)
