Direct search algorithms for optimization calculations

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the Lagrange functions of quadratic models that are defined by interpolation* (2001, methodology): “That remark was the basis of some new techniques that were described in a talk by the author at the 5th Stockholm Optimization Days in 1994, and that are mentioned in a survey paper (Powell, 1998).”
Policy Search using Paired Comparisons (2003, unknown): “Powell (1998) describes many optimization procedures.”
Free-form-deformation parameterization for multilevel 3D shape optimization in aerodynamics (2003, unknown): “One of the representives of such algorithms are the direct search methods [39], [23].”
Recent advances in trust region algorithms (2015, background): “Excellent reviews on trust region algorithms for optimization without derivatives are given in [95,97] and [29].”
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods (2003, methodology): “These methods have received much attention of late and show some connections with the ideas presented here, but for a more thorough treatment we refer interested readers to the reviews [72] [221].”
Direct Policy Search using Paired Statistical Tests (2001, methodology): “A perceived advantage of the Pegasus method is that the gradient of ( )”
UOBYQA: unconstrained optimization by quadratic approximation (2002, methodology): “Moreover, the equations (10) are equivalent to the system ( GQ T + θI ) ( d) = − hQ, (11)”