Pages that link to "Item:Q933803"

The following pages link to Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803):

Displaying 50 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems (Q486382) (← links)
• Optimization of algorithms with OPAL (Q495935) (← links)
• Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption (Q506438) (← links)
• A note on diameters of point sets (Q601983) (← links)
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
• A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
• Spent potliner treatment process optimization using a MADS algorithm (Q833446) (← links)
• A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
• Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
• A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes (Q887203) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Globalization strategies for mesh adaptive direct search (Q975357) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← 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)
• Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← 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)
• Gaussian variable neighborhood search for continuous optimization (Q1761147) (← links)
• Efficient use of parallelism in algorithmic parameter optimization applications (Q1941182) (← links)
• The linear stochastic order and directed inference for multivariate ordered distributions (Q1952440) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← 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)
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• A mesh adaptive direct search algorithm for multiobjective optimization (Q2267660) (← links)
• Multi-fidelity shape optimization of hydraulic turbine runner blades using a multi-objective mesh adaptive direct search algorithm (Q2290065) (← links)
• Dynamic improvements of static surrogates in direct search optimization (Q2329664) (← links)
• GLODS: global and local optimization using direct search (Q2350072) (← links)
• Constrained problem formulations for power optimization of aircraft electro-thermal anti-icing systems (Q2357949) (← links)
• Use of a biobjective direct search algorithm in the process design of material science applications (Q2357963) (← links)
• Using a derivative-free optimization method for multiple solutions of inverse transport problems (Q2357971) (← links)
• Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm (Q2357973) (← links)
• Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) (← links)
• Binary, unrelaxable and hidden constraints in blackbox optimization (Q2661502) (← links)
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
• Parallel strategies for direct multisearch (Q2699998) (← links)
• Derivative-free nonlinear optimization filter simplex (Q3083910) (← links)
• Asynchronous parallel hybrid optimization combining DIRECT and GSS (Q3161143) (← links)
• Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search (Q3388795) (← 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)
• Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
• Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
• Escaping Unknown Discontinuous Regions in Blackbox Optimization (Q5097015) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Trade-off studies in blackbox optimization (Q5200553) (← links)