Pages that link to "Item:Q3503207"

The following pages link to Using Sampling and Simplex Derivatives in Pattern Search Methods (Q3503207):

Displaying 50 items.

• A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
• Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework (Q386480) (← links)
• Pattern search methods framework for beam angle optimization in radiotherapy design (Q482433) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• Large-scale history matching with quadratic interpolation models (Q509795) (← links)
• An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
• Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
• A derivative-free trust region framework for variational data assimilation (Q747924) (← links)
• Mesh adaptive direct search with second directional derivative-based Hessian update (Q902088) (← links)
• Incorporating minimum Frobenius norm models in direct search (Q975361) (← links)
• Theoretical connections between optimization algorithms based on an approximate gradient (Q1663476) (← links)
• Compositions of convex functions and fully linear models (Q1679619) (← links)
• Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
• Calibration of parameters in dynamic energy budget models using direct-search methods (Q1741538) (← links)
• Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
• Approximating the diagonal of a Hessian: which sample set of points should be used (Q2084264) (← links)
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
• Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
• Efficient unconstrained black box optimization (Q2146451) (← links)
• An adaptive direct multisearch method for black-box multi-objective optimization (Q2168631) (← links)
• Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification (Q2191793) (← links)
• Improved sampling strategies for ensemble-based optimization (Q2192778) (← links)
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) (← links)
• Mesh adaptive direct search with simplicial Hessian update (Q2282812) (← 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)
• Sustainability SI: optimal prices of electricity at public charging stations for plug-in electric vehicles (Q2357865) (← links)
• Calibration by optimization without using derivatives (Q2358082) (← links)
• Constrained derivative-free optimization on thin domains (Q2392122) (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
• Efficient calculation of regular simplex gradients (Q2419521) (← links)
• A particle swarm pattern search method for bound constrained global optimization (Q2454725) (← links)
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
• A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
• Filling holes under non-linear constraints (Q2695658) (← links)
• A subclass of generating set search with convergence to second-order stationary points (Q2926059) (← links)
• An active-set trust-region method for derivative-free nonlinear bound-constrained optimization (Q3096885) (← links)
• Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems (Q3458824) (← links)
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization (Q4924108) (← links)
• Derivative-free optimization methods for finite minimax problems (Q4924116) (← links)
• A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Black-Box Optimization: Methods and Applications (Q5153493) (← links)
• An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization (Q5172957) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• CONORBIT: constrained optimization by radial basis function interpolation in trust regions (Q5268937) (← links)
• Derivative-Free Optimization for Population Dynamic Models (Q5357002) (← links)
• A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions (Q5379464) (← links)
• Direct Search Based on Probabilistic Descent (Q5502242) (← links)
• Calculus Identities for Generalized Simplex Gradients: Rules and Applications (Q5853722) (← links)