Pages that link to "Item:Q2726098"
From MaRDI portal
The following pages link to A fully‐distributed parallel global search algorithm (Q2726098):
Displaying 11 items.
- Parallel deterministic and stochastic global minimization of functions with very many minima (Q461454) (← links)
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
- Design and implementation of a massively parallel version of DIRECT (Q953213) (← links)
- A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739) (← links)
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602) (← links)
- Global optimization approaches to an aircraft routing problem (Q1869579) (← links)
- Multidimensional global extremum seeking via the DIRECT optimisation algorithm (Q2356647) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- Parallel strategies for direct multisearch (Q2699998) (← links)
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)
- Applying artificial neural networks to solve the inverse problem of evaluating concentrations in multianalyte mixtures from biosensor signals (Q6202316) (← links)
