Generalized pattern searches with derivative information
A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses that question with respect to generalized pattern search (GPS) methods for unconstrained and linearly constrained optimization. Specifically, this paper concentrates on the GPS POLLstep. Polling is done to certify the need to refine the current mesh, and it requires \(O(n)\) function evaluations in the worst case. We show that the use of derivative information significantly reduces the maximum number of function evaluations necessary for POLLsteps, even to a worst case of a single function evaluation with certain algorithmic choices given here. Furthermore, we show that rather rough approximations to the gradient are sufficient to reduce the POLLstep to a single function evaluation. We prove that using these less expensive POLLsteps does not weaken the known convergence properties of the method, all of which depend only on the POLLstep.
- Analysis of Generalized Pattern Searches
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Using simplex gradients of nonsmooth functions in direct search methods
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- Use of static surrogates in hyperparameter optimization
- Pattern search method for discrete \(L_{1}\)-approximation
- A subclass of generating set search with convergence to second-order stationary points
- Industrial robot layout based on operation sequence optimisation
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- Using first-order information in direct multisearch for multiobjective optimization
- Black-Box Optimization: Methods and Applications
- Derivative-free optimization methods
- Generation of Optimal Artificial Neural Networks Using a Pattern Search Algorithm: Application to Approximation of Chemical Systems
- Second-Order Behavior of Pattern Search
- Damage location in mechanical structures by multi-objective pattern search
- Blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy
This page was built for publication: Generalized pattern searches with derivative information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890302)
