Pages that link to "Item:Q3395009"

The following pages link to Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm (Q3395009):

Displaying 32 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A variance-based method to rank input variables of the mesh adaptive direct search algorithm (Q479211) (← links)
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
• Asynchronously parallel optimization solver for finding multiple minima (Q1621691) (← links)
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
• Parallel distributed block coordinate descent methods based on pairwise comparison oracle (Q1675626) (← links)
• Efficient use of parallelism in algorithmic parameter optimization applications (Q1941182) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (Q1993602) (← links)
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
• Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique (Q2061776) (← links)
• GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration (Q2069161) (← links)
• Optimal 3D printing of complex objects in a \(5\)-axis printer (Q2147940) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• Decomposition in derivative-free optimization (Q2231319) (← links)
• A mesh adaptive direct search algorithm for multiobjective optimization (Q2267660) (← links)
• A batch, derivative-free algorithm for finding multiple local minima (Q2357976) (← links)
• Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) (← links)
• A decomposition method by interaction prediction for the optimization of maintenance scheduling (Q2675640) (← links)
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
• Parallel strategies for direct multisearch (Q2699998) (← links)
• On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables (Q4634101) (← links)
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization (Q4924108) (← links)
• Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
• An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization (Q5172957) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Parallel Processing and Applied Mathematics (Q5307344) (← links)
• Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem (Q6062853) (← links)
• Two decades of blackbox optimization applications (Q6114909) (← links)
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization (Q6175470) (← links)
• \(Q\)-fully quadratic modeling and its application in a random subspace derivative-free method (Q6624430) (← links)