Abstract
The Quasi-Newton method (QN) is widely used in solving large-scale optimization problems due to its high efficiency. However, this algorithm requires a large number of iterative calculations, which is more time-consuming to compute in software. The Davidon-Fletcher-Powell (DFP) algorithm has been implemented on field-programmable gate array (FPGA) in order to speed up the computation. The number of iterations in the online search part of the algorithm is excessive, which affects the speed of the calculation. In order to solve this problem, this paper proposes a hardware implementation of DFP algorithm using inexact linear search. The results show that the calculation speed of the DFP algorithm implemented in this paper on the software side and FPGA platform is increased by 7.59 times and 3.08 times, respectively. And resource consumption and accuracy have little effect on the results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
