Pages that link to "Item:Q3611732"

The following pages link to Introduction to Derivative-Free Optimization (Q3611732):

Displaying 50 items.

• Joint model of probabilistic-robust (probust) constraints applied to gas network optimization (Q2244692) (← links)
• DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
• How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem (Q2245689) (← links)
• Order statistics and region-based evolutionary computation (Q2249813) (← links)
• Derivative-free optimization via proximal point methods (Q2250069) (← links)
• Mesh adaptive direct search with simplicial Hessian update (Q2282812) (← links)
• Numerical optimization applying trust-region reflective least squares algorithm with constraints to optimize the non-linear creep parameters of soft soil (Q2284431) (← links)
• Derivative-free robust optimization by outer approximations (Q2288189) (← links)
• A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
• A derivative-free Gauss-Newton method (Q2295977) (← links)
• A derivative-free algorithm for spherically constrained optimization (Q2307754) (← links)
• Non-linear data assimilation via trust region optimization (Q2322777) (← links)
• Positive bases with maximal cosine measure (Q2329658) (← links)
• Dynamic improvements of static surrogates in direct search optimization (Q2329664) (← links)
• Derivative free methodologies for circuit worst case analysis (Q2329675) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Linear equalities in blackbox optimization (Q2340487) (← links)
• A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
• Derivative-free methods for mixed-integer constrained optimization problems (Q2342138) (← links)
• Recovering a polyhedral obstacle by a few backscattering measurements (Q2347026) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• GLODS: global and local optimization using direct search (Q2350072) (← links)
• A wedge trust region method with self-correcting geometry for derivative-free optimization (Q2353471) (← links)
• The calculus of simplex gradients (Q2355312) (← links)
• Control of dead-time systems using derivative free local search guided population based incremental learning algorithms (Q2357204) (← links)
• An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints (Q2357423) (← links)
• An adaptive-topology ensemble algorithm for engineering optimization problems (Q2357899) (← links)
• Use of a biobjective direct search algorithm in the process design of material science applications (Q2357963) (← links)
• Optimizing damper connectors for adjacent buildings (Q2357966) (← links)
• A hybrid extended pattern search/genetic algorithm for multi-stage wind farm optimization (Q2357968) (← links)
• Using a derivative-free optimization method for multiple solutions of inverse transport problems (Q2357971) (← links)
• Optimization with hidden constraints and embedded Monte Carlo computations (Q2357974) (← links)
• MISO: mixed-integer surrogate optimization framework (Q2357975) (← 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)
• Integration of expert knowledge into radial basis function surrogate models (Q2358065) (← links)
• Calibration by optimization without using derivatives (Q2358082) (← links)
• Use of reduced-order models in well control optimization (Q2358136) (← links)
• ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (Q2359400) (← links)
• Exploiting active subspaces to quantify uncertainty in the numerical simulation of the hyshot II scramjet (Q2374810) (← links)
• Constrained derivative-free optimization on thin domains (Q2392122) (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
• A quasi-multistart framework for global optimization of expensive functions using response surface models (Q2393073) (← links)
• Random gradient-free minimization of convex functions (Q2397749) (← links)
• A Lagrangian propagator for artificial neural networks in constraint programming (Q2398510) (← links)
• A frame-based conjugate gradients direct search method with radial basis function interpolation model (Q2398571) (← links)
• Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
• Efficient calculation of regular simplex gradients (Q2419521) (← links)