Randomized Hessian estimation and directional search

  title={Randomized Hessian estimation and directional search},
  author={D. Leventhal and Adrian S. Lewis},
We explore how randomization can help asymptotic convergence properties of simple directional search-based optimization methods. Specifically, we develop a cheap, iterative randomized Hessian estimation scheme. We then apply this technique and analyze how it enhances a random directional search method. Then, we proceed to develop a conjugate-directional search method that incorporates estimated Hessian information without requiring the direct use of gradients. ∗School of Operations Research and… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 15 references

On the convergence of the coordinate descent method for convex differentiable minimization

Z. Q. Luo, P. Tseng
Journal of Optimization Theory and Applications, • 1992
View 1 Excerpt

On linear convergence of a class of random search algorithms

G. Rappl
ZAMM - Journal of Applied Mathematics and Mechanics, • 1989
View 1 Excerpt

Numerical Techniques for Stochastic Optimization

Yu. Ermoliev, R.J.-B. Wets

Probability and Measure

P. Billingsley
View 1 Excerpt

A new direction set method for unconstrained minimization without evaluating derivatives

K. W. Brodlie
Journal of the Institute of Mathematics and Its Applications, • 1975
View 1 Excerpt

More . A characterization of superlinear convergence and its application to quasiNewton methods

J. J.
Towards Global Optimisation • 1975

Similar Papers

Loading similar papers…