A matrix algebra approach to approximate Hessians
Preprint
Abstract
This work presents a novel matrix-based method for constructing an approximation Hessian using only function evaluations. The method requires less computational power than interpolation-based methods and is easy to implement in matrix-based programming languages such as MATLAB. As only function evaluations are required, the method is suitable for use in derivative-free algorithms. For reasonably structured sample sets, the method is proven to create an order-$1$ accurate approximation of the full Hessian. Under more specialized structures, the method is proved to yield order-$2$ accuracy. The undetermined case, where the number of sample points is less than required for full interpolation, is studied and error bounds are developed for the resulting partial Hessians.Keywords
All Related Versions
This publication has 36 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