Pages that link to "Item:Q1800457"

The following pages link to Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457):

Displaying 8 items.

• The DIRECT algorithm: 25 years later (Q2022319) (← links)
• A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
• On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
• A THREE-LEVEL PARALLELISATION SCHEME AND APPLICATION TO THE NELDER-MEAD ALGORITHM (Q5016267) (← links)
• Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← 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)