A modified DIRECT algorithm with bilevel partition
From MaRDI portal
Publication:480826
DOI10.1007/s10898-013-0119-1zbMath1303.90083OpenAlexW2013072143MaRDI QIDQ480826
Publication date: 11 December 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0119-1
Related Items (16)
Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Adaptive block coordinate DIRECT algorithm ⋮ Granular sieving algorithm for selecting best n$$ n $$ parameters ⋮ Kriging-based infill sampling criterion for constraint handling in multi-objective optimization ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ 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 ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Filter-based DIRECT method for constrained global optimization ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Numerical algorithms for solving the optimal control problem of simple bioreactors ⋮ MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization by multilevel partition
- Additive scaling and the \texttt{DIRECT} algorithm
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- A polyhedral branch-and-cut approach to global optimization
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Linear scaling and the DIRECT algorithm
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- An overview of bilevel optimization
- A Multigrid Tutorial, Second Edition
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: A modified DIRECT algorithm with bilevel partition
