An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
From MaRDI portal
Publication:6200381
DOI10.1007/s10898-022-01185-5arXiv2109.14912OpenAlexW3204839188MaRDI QIDQ6200381
Linas Stripinis, Remigijus Paulavičius
Publication date: 22 March 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.14912
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ Preface
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- Additive scaling and the \texttt{DIRECT} algorithm
- Design and implementation of a massively parallel version of DIRECT
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- A comparison of global optimization methods for the design of a high-speed civil transport
- Algorithms for noisy problems in gas transmission pipeline optimization
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- The DIRECT algorithm: 25 years later
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization 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
- A fully‐distributed parallel global search algorithm
- Simplicial Global Optimization
- Algorithm 897
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
- An algorithm for finding the absolute extremum of a function
- Deterministic Global Optimization
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
This page was built for publication: An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
