Using Sampling and Simplex Derivatives in Pattern Search Methods
From MaRDI portal
Recommendations
- Generalized pattern searches with derivative information
- Using simplex gradients of nonsmooth functions in direct search methods
- scientific article; zbMATH DE number 1728382
- Simulated annealing based on pattern search with derivative information
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
Cited in
(60)- Theoretical connections between optimization algorithms based on an approximate gradient
- Compositions of convex functions and fully linear models
- Nonsmooth spectral gradient methods for unconstrained optimization
- Calibration of parameters in dynamic energy budget models using direct-search methods
- Generalized pattern searches with derivative information
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Approximating the diagonal of a Hessian: which sample set of points should be used
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Efficient unconstrained black box optimization
- An adaptive direct multisearch method for black-box multi-objective optimization
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
- Improved sampling strategies for ensemble-based optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Mesh adaptive direct search with simplicial Hessian update
- The calculus of simplex gradients
- Control of dead-time systems using derivative free local search guided population based incremental learning algorithms
- Sustainability SI: optimal prices of electricity at public charging stations for plug-in electric vehicles
- Calibration by optimization without using derivatives
- Constrained derivative-free optimization on thin domains
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Efficient calculation of regular simplex gradients
- A particle swarm pattern search method for bound constrained global optimization
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A trust-region-based derivative free algorithm for mixed integer programming
- Filling holes under non-linear constraints
- scientific article; zbMATH DE number 1728382 (Why is no real title available?)
- A subclass of generating set search with convergence to second-order stationary points
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- Using simplex gradients of nonsmooth functions in direct search methods
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Simulated annealing based on pattern search with derivative information
- Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework
- Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems
- Pattern search methods framework for beam angle optimization in radiotherapy design
- Inexact restoration method for nonlinear optimization without derivatives
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Derivative-free optimization methods for finite minimax problems
- A Derivative-Free Method for Structured Optimization Problems
- Large-scale history matching with quadratic interpolation models
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Black-Box Optimization: Methods and Applications
- An initialization strategy for high-dimensional surrogate-based expensive black-box optimization
- An inexact restoration derivative-free filter method for nonlinear programming
- Derivative-free optimization methods
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- Derivative-free optimization for population dynamic models
- Sampling Optimization for Printer Characterization by Greedy Search
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- Direct search based on probabilistic descent
- Calculus identities for generalized simplex gradients: rules and applications
- Full-low evaluation methods for derivative-free optimization
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- An approximating state-dependent control method based on modified pattern search optimization for nonlinear optimal control problem
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- Using generalized simplex methods to approximate derivatives
- A derivative-free trust region framework for variational data assimilation
- Mesh adaptive direct search with second directional derivative-based Hessian update
- Incorporating minimum Frobenius norm models in direct search
This page was built for publication: Using Sampling and Simplex Derivatives in Pattern Search Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503207)
