Fetching the paper…
Reading the bibliography…
We consider the problem of unconstrained minimization of a smooth function in the derivative-free setting using.
Direct search solution of numerical and statistical problems
R Hooke and T A Jeeves · 1961
Earlier work this paper cites.
Positive basis and a class of direct search techniques
Yu Wen-ci · 1979
Earlier work this paper cites.
On the convergence of pattern search algorithms
V Torczon · 1997
Earlier work this paper cites.
Analysis of generalized pattern searches
C Audet and J E Dennis Jr · 2002
Earlier work this paper cites.
On the local convergence of pattern search
E D Dolan, R M Lewis, and V Torczon · 2003
Earlier work this paper cites.
Optimization by direct search: New perspectives on some classical and modern methods
T G Kolda, R M Lewis, and V Torczon · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yu Nesterov · 2004
Earlier work this paper cites.
Convergence of mesh adaptive direct search to second-order stationary points
M A Abramson and C Audet · 2006
Earlier work this paper cites.
Mesh adaptive direct search algorithms for constrained optimization
C Audet and J E Dennis Jr · 2006
Cited alongside, same era.
Finding optimal algorithmic parameters using derivative-free optimization
C Audet and D Orban · 2006
Cited alongside, same era.
Introduction to Derivative-Free Optimization
A R Conn, K Scheinberg, and L N Vicente · 2009
Cited alongside, same era.
On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization problems
C Cartis, N I M Gould, and P L Toint · 2010
Cited alongside, same era.
Analysis of direct searches for discontinuous functions
L N Vicente and A L Custódio · 2010
Cited alongside, same era.
Random gradient-free minimization of convex functions
Yu Nesterov · 2011
Cited alongside, same era.
Smoothing and worst case complexity for direct-search methods in non-smooth optimization
R Garmanjani and L N Vicente · 2012
Later among the works it cites.
Query complexity of derivative-free optimization
B Recht, K G Jamieson, and R Nowak · 2012
Later among the works it cites.
Worst case complexity of direct search under convexity
M Dodangeh and L N Vicente · 2013
Later among the works it cites.
Optimal rates for zero-order optimization: the power of two function evaluations
J C Duchi, M I Jordan, M J Wainwright, and A Wibisono · 2013
Later among the works it cites.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
S Ghadimi and G Lan · 2013
Later among the works it cites.
Worst case complexity of direct search
L N Vicente · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
C Cartis, N I M Gould, and P L Toint · 2012
Cited alongside, same era.
Direct search based on probabilistic descent
S Gratton, C W Royer, L N Vicente, and Z Zhang
Cited in the paper.
Later among the works it cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P Richtárik and M Takáč · 2014
Closest in time.