University of British Columbia
Using complex step numerical differentiation in the Broyden-Fletcher-Goldfard-Shanno algorithm
Abstract
dc:descriptionWe conduct a study on an alternative method to Derivative-Free Optimization (DFO). It is a method by applying numerical differentiation techniques to the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm. We apply different gradient approximation strategies on the BFGS, particularly a complex-step method to the gradient approximation. We conduct an experiment to test the feasibility of the approximation-based-BFGS methods. The experiment also explores the efficiency and reliability of BFGS algorithm with different strategies and different settings. Results find that the approximation-based-BFGS method is feasible alternative to DFO. With appropriate parameter settings, approximation-based-BFGS methods achieve high level accuracy relative to the original BFGS method. Among different numerical differentiation techniques, the approximation-based-BFGS method with complex-step achieves outstanding and stable performance in accuracy.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Chen, Jinghong
- Contributors dc:contributor
-
- Hare, Warren
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/84716