Hessian approximations
Preprint
Abstract
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized simplex gradient and proved to have an error bound that is on the order of the maximal radius of the two sets used in its construction. We show that when the points used in the computation of the nested-set Hessian have a favourable structure, (n+1)(n+2)/2 function evaluations are sufficient to approximate the Hessian. However, the nested-set Hessian also allows for evaluation sets with more points without negating the error analysis. Two calculus-based approximation techniques of the Hessian are developed and some advantages of the same are demonstrated.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Efficient calculation of regular simplex gradientsComputational Optimization and Applications, 2019
- Direct search based on probabilistic feasible descent for bound and linearly constrained problemsComputational Optimization and Applications, 2019
- Derivative-free robust optimization by outer approximationsMathematical Programming, 2018
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity boundsMathematical Programming, 2018
- Mesh-based Nelder–Mead algorithm for inequality constrained optimizationComputational Optimization and Applications, 2018
- An implicit filtering algorithm for derivative-free multiobjective optimization with box constraintsComputational Optimization and Applications, 2017
- A proximal bundle method for nonsmooth nonconvex functions with inexact informationComputational Optimization and Applications, 2015
- A derivative-free approximate gradient sampling algorithm for finite minimax problemsComputational Optimization and Applications, 2013
- Geometry of interpolation sets in derivative free optimizationMathematical Programming, 2006
- On trust region methods for unconstrained minimization without derivativesMathematical Programming, 2003