Pages that link to "Item:Q2022319"
From MaRDI portal
The following pages link to The DIRECT algorithm: 25 years later (Q2022319):
Displaying 23 items.
- Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
- Additive scaling and the \texttt{DIRECT} algorithm (Q858583) (← links)
- Adaptive block coordinate DIRECT algorithm (Q1685578) (← links)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
- Dynamic data structures for a direct search algorithm (Q1812081) (← links)
- On the extension of the \textsc{direct} algorithm to multiple objectives (Q2022240) (← links)
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
- Pure random search with virtual extension of feasible region (Q2093284) (← links)
- Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
- Multidimensional global extremum seeking via the DIRECT optimisation algorithm (Q2356647) (← links)
- A new sampling method in the DIRECT algorithm (Q2369158) (← links)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems (Q2379688) (← links)
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- A fully-distributed parallel global search algorithm (Q2726098) (← links)
- Asynchronous parallel hybrid optimization combining DIRECT and GSS (Q3161143) (← links)
- Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
- Bridging formal methods and machine learning with model checking and global optimisation (Q6151625) (← links)
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
- A new partition method for DIRECT-type algorithm based on minimax design (Q6183090) (← links)
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets (Q6568951) (← links)
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization (Q6599982) (← links)
