Pages that link to "Item:Q3563916"

The following pages link to OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions (Q3563916):

Displaying 50 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions (Q381689) (← links)
• Semiconductor device design using the \textsc{BiMADS} algorithm (Q401540) (← links)
• A variance-based method to rank input variables of the mesh adaptive direct search algorithm (Q479211) (← 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)
• Constrained optimization of an idealized Y-shaped baffle for the Fontan surgery at rest and exercise (Q658825) (← links)
• A risk-averse stochastic program for integrated system design and preventive maintenance planning (Q666964) (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
• Equal angle distribution of polling directions in direct-search methods (Q896733) (← links)
• Mesh adaptive direct search with second directional derivative-based Hessian update (Q902088) (← links)
• 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)
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
• Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization (Q1685588) (← links)
• Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
• Nonasymptotic densities for shape reconstruction (Q1723894) (← links)
• Direct search methods on reductive homogeneous spaces (Q1752640) (← 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)
• New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates (Q1955548) (← 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)
• 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)
• A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
• A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies (Q2115032) (← links)
• Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
• Uniform simplex of an arbitrary orientation (Q2192988) (← links)
• A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization (Q2218904) (← links)
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
• An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
• A mesh adaptive direct search algorithm for multiobjective optimization (Q2267660) (← links)
• Mesh adaptive direct search with simplicial Hessian update (Q2282812) (← 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)
• Derivative free methodologies for circuit worst case analysis (Q2329675) (← links)
• Mathematical modeling and optimal blank generation in glass manufacturing (Q2336874) (← links)
• Linear equalities in blackbox optimization (Q2340487) (← 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)
• On the properties of positive spanning sets and positive bases (Q2357977) (← links)
• Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
• Multi-objective optimization of chemical reaction conditions based on a kinetic model (Q2419172) (← links)
• Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions (Q2442697) (← links)