Design Space Exploration to Accelerate Nelder-Mead Algorithm Using FPGA

Design Space Exploration to Accelerate Nelder-Mead Algorithm Using FPGA
Title:
Design Space Exploration to Accelerate Nelder-Mead Algorithm Using FPGA
Other Titles:
Field-Programmable Custom Computing Machines (FCCM), 2014 IEEE 22nd Annual International Symposium on
Keywords:
Publication Date:
11 May 2014
Citation:
N. K. Pham, A. K. Singh, A. Kumar and K. M. M. Aung, "Design Space Exploration to Accelerate Nelder-Mead Algorithm Using FPGA," Field-Programmable Custom Computing Machines (FCCM), 2014 IEEE 22nd Annual International Symposium on, Boston, MA, 2014, pp. 100-100.
Abstract:
Nelder-Mead algorithm (NMA) is the best-known algorithm for multidimensional optimization without involving derivative computations. Due to the simplicity in implementation and the fast convergent property of NMA, it is widely used in the fields of statistics, engineering, physics and medical sciences. In practice, when objective function is complicated, the optimization procedure requires a lot of computation efforts, leading to a time-consuming process. This work introduces a NMA solver engine fully implemented on FPGA hardware and performs design space exploration to provide various solutions suitable for FPGA device.
License type:
PublisherCopyrights
Funding Info:
Description:
(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
ISBN:
978-1-4799-5110-9
Files uploaded:

File Size Format Action
fy13-2519.pdf 135.18 KB PDF Open