The DIRECT algorithm: 25 years later
From MaRDI portal
Publication:2022319
DOI10.1007/s10898-020-00952-6zbMath1466.90076OpenAlexW3093015498MaRDI QIDQ2022319
Joaquim R. R. A. Martins, Donald R. Jones
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00952-6
DIRECTglobal optimizationderivative-freeblack-boxLipschitzian optimizationexploitation versus exploration
Related Items (7)
Branch-and-Model: a derivative-free global optimization algorithm ⋮ Bridging formal methods and machine learning with model checking and global optimisation ⋮ 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 new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ Pure random search with virtual extension of feasible region
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Improving the convergence rate of the DIRECT global optimization algorithm
- Filter-based DIRECT method for constrained global optimization
- Array processing and fast optimization algorithms for distorted circular contour retrieval
- Additive scaling and the \texttt{DIRECT} algorithm
- Multidimensional Lipschitz global optimization based on efficient diagonal partitions
- Global one-dimensional optimization using smooth auxiliary functions
- Global optimization by multilevel coordinate search
- On using estimates of Lipschitz constants in global optimization
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Adaptive block coordinate DIRECT algorithm
- Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations
- 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
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- 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 identification of the convex hull of a finite set of points in the plane
- Homogeneous algorithms for multiextremal optimization
- An algorithm for finding the absolute extremum of a function
- An Information Global Optimization Algorithm with Local Tuning
- 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
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Nonlinear programming without a penalty function.
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
This page was built for publication: The DIRECT algorithm: 25 years later
