Pages that link to "Item:Q1812081"

The following pages link to Dynamic data structures for a direct search algorithm (Q1812081):

Displaying 19 items.

• Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
• Parallel deterministic and stochastic global minimization of functions with very many minima (Q461454) (← links)
• Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
• A modified DIviding RECTangles algorithm for a problem in astrophysics (Q650229) (← links)
• Additive scaling and the \texttt{DIRECT} algorithm (Q858583) (← links)
• Surface passivation optimization using DIRECT (Q886066) (← 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)
• Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm (Q2357973) (← 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)
• Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle (Q2481377) (← links)
• On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
• Multiobjective optimization using an adaptive weighting scheme (Q2811485) (← links)
• Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm (Q4924117) (← links)
• Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)