Pages that link to "Item:Q5470251"

The following pages link to Mesh Adaptive Direct Search Algorithms for Constrained Optimization (Q5470251):

Displaying 50 items.

• A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation (Q975138) (← links)
• Globalization strategies for mesh adaptive direct search (Q975357) (← links)
• A computational framework for derivative-free optimization of cardiovascular geometries (Q995283) (← links)
• Mesh adaptive direct search algorithms for mixed variable optimization (Q1001325) (← links)
• EGO shape optimization of Horn-loaded loudspeakers (Q1024092) (← links)
• Low order-value optimization and applications (Q1029662) (← links)
• Pattern search ranking and selection algorithms for mixed variable simulation-based optimization (Q1042073) (← links)
• A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
• Accelerated random search for constrained global optimization assisted by radial basis function surrogates (Q1636769) (← links)
• Empirical study of the improved UNIRANDI local search method (Q1642808) (← links)
• Identification and control of delayed unstable and integrative LTI MIMO systems using pattern search methods (Q1653147) (← links)
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
• Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method (Q1653583) (← links)
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
• Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models (Q1660159) (← links)
• Regularized virtual fields method for mechanical properties identification of composite materials (Q1667341) (← links)
• GOSAC: global optimization with surrogate approximation of constraints (Q1675641) (← links)
• Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization (Q1685588) (← links)
• Multi-objective retrospective optimization using stochastic zigzag search (Q1694838) (← links)
• Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
• Global minimization of nonsmooth constrained global optimization with filled function (Q1718659) (← links)
• A new method for solving supervised data classification problems (Q1723858) (← links)
• Nonasymptotic densities for shape reconstruction (Q1723894) (← links)
• RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
• Calibration of parameters in dynamic energy budget models using direct-search methods (Q1741538) (← links)
• Direct search methods on reductive homogeneous spaces (Q1752640) (← links)
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
• MultiGLODS: global and local multiobjective optimization using direct search (Q1756778) (← links)
• Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
• Distributed Gauss-Newton optimization method for history matching problems with multiple best matches (Q1785159) (← links)
• A new Pareto set generating method for multi-criteria optimization problems (Q1785297) (← links)
• Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
• A mesh adaptive basin hopping method for the design of circular antenna arrays (Q1935264) (← links)
• Efficient use of parallelism in algorithmic parameter optimization applications (Q1941182) (← links)
• Global minimization of non-smooth unconstrained problems with filled function (Q1941186) (← links)
• New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates (Q1955548) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
• Methods for improving the efficiency of swarm optimization algorithms. A survey (Q1982839) (← links)
• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (Q1993602) (← links)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• Design of IMEXRK time integration schemes via Delaunay-based derivative-free optimization with nonconvex constraints and grid-based acceleration (Q2022320) (← links)
• On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
• Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
• The theories of a novel filled function method for non-smooth global optimization (Q2039687) (← links)
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization (Q2044473) (← links)
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) (← links)
• Surrogate optimization of deep neural networks for groundwater predictions (Q2046338) (← links)
• Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique (Q2061776) (← links)