New Criteria for Comparing Global Stochastic Derivative-Free Optimization Algorithms
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 7
Abstract
For many situations, the function that best models a situation or data set can have a derivative that may be difficult or impossible to find, leading to difficulties in obtaining information about the optimal values of the function. Thus, numerical methods for finding these important values without the direct involvement of the derivative have been developed, making the representation and interpretation of the results for these algorithms of importance to the researchers using them. This is the motivation to use and compare between derivative-free optimization (DFO) algorithms. The comparison methods developed in this paper were tested using three global solvers: Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Simulated Annealing (SA) on a set of 26 n-dimensional test problems of varying convexity, continuity, differentiability, separability, and modality. Each solver was run 100 times per problem at 2, 20, 50 and 100 dimensions. The formulation for each algorithm used comes from the MATLAB Optimization Toolbox, unedited or revised. New criteria for comparing DFO solver performance are introduced in terms defined as Speed, Accuracy, and Efficiency, taken at different levels of precision and dimensionality. The numerical results for these benchmark problems are analyzed using these methods.
Authors and Affiliations
Jonathan McCart, Ahmad Almomani
Keywords
Related Articles
- EP ID EP611511
- DOI 10.14569/IJACSA.2019.0100781
- Views 95
- Downloads 0
Noble Method for Data Hiding using Steganography Discrete Wavelet Transformation and Cryptography Triple Data Encryption Standard: DES
Noble method for data hiding using steganography Discrete Wavelet Transformation: DWT and cryptography triple Data Encryption Standard: DES is proposed. In the current era, information technology has become inseparable f...
Sorting Pairs of Points Based on Their Distances
Sorting data is one of the main problems in computer science which studied vastly and used in several places. In several geometric problems, like problems on point sets or lines in the plane or Euclidean space with highe...
ReCSDN: Resilient Controller for Software Defined Networks
Software Defined Networking (SDN) is an emerging network paradigm that provides central control over the network. Although, this simplifies the network management and makes efficient use of network resources, it introduc...
Performance Comparison between MAI and Noise Constrained LMS Algorithm for MIMO CDMA DFE and Linear Equalizers
This paper presents a performance comparison between a constrained least mean squared algorithm for MIMO CDMA decision feedback equalizer and linear equalizer. Both algorithms are constrained on the length of spreading s...
Deep Gated Recurrent and Convolutional Network Hybrid Model for Univariate Time Series Classification
Hybrid LSTM-fully convolutional networks (LSTM-FCN) for time series classification have produced state-of-the-art classification results on univariate time series. We empirically show that replacing the LSTM with a gated...