Parallel Search Optimization for Storage Virtualization

2010 ◽  
pp. 103-133
Keyword(s):  
Parallel Search ◽  
Storage Virtualization ◽  
Search Optimization

A new technique for guided filter based image denoising using modified cuckoo search optimization

2021 ◽  
Vol 176 ◽  
pp. 114884
Author(s):  
Himanshu Singh ◽  
Sethu Venkata Raghavendra Kommuri ◽  
Anil Kumar ◽  
Varun Bajaj
Keyword(s):  
Image Denoising ◽  
Cuckoo Search ◽  
New Technique ◽  
Guided Filter ◽  
Search Optimization ◽  
Cuckoo Search Optimization ◽  
A New Technique

scholarly journals A modified simplex based direct search optimization algorithm for adaptive transversal FIR filters

2021 ◽  
Vol 104 (2) ◽  
pp. 003685042110254
Author(s):  
Armaghan Mohsin ◽  
Yazan Alsmadi ◽  
Ali Arshad Uppal ◽  
Sardar Muhammad Gulfam
Keyword(s):  
Optimization Algorithm ◽  
Optimization Technique ◽  
Fast Convergence ◽  
Good Convergence ◽  
Optimum Point ◽  
Search Optimization ◽  
Higher Dimensional ◽  
Gradient Based ◽  
Improved Accuracy ◽  
Quadratic Cost Function

In this paper, a novel modified optimization algorithm is presented, which combines Nelder-Mead (NM) method with a gradient-based approach. The well-known Nelder Mead optimization technique is widely used but it suffers from convergence issues in higher dimensional complex problems. Unlike the NM, in this proposed technique we have focused on two issues of the NM approach, one is shape of the simplex which is reshaped at each iteration according to the objective function, so we used a fixed shape of the simplex and we regenerate the simplex at each iteration and the second issue is related to reflection and expansion steps of the NM technique in each iteration, NM used fixed value of [Formula: see text], that is, [Formula: see text]  = 1 for reflection and [Formula: see text]  = 2 for expansion and replace the worst point of the simplex with that new point in each iteration. In this way NM search the optimum point. In proposed algorithm the optimum value of the parameter [Formula: see text] is computed and then centroid of new simplex is originated at this optimum point and regenerate the simplex with this centroid in each iteration that optimum value of [Formula: see text] will ensure the fast convergence of the proposed technique. The proposed algorithm has been applied to the real time implementation of the transversal adaptive filter. The application used to demonstrate the performance of the proposed technique is a well-known convex optimization problem having quadratic cost function, and results show that the proposed technique shows fast convergence than the Nelder-Mead method for lower dimension problems and the proposed technique has also good convergence for higher dimensions, that is, for higher filter taps problem. The proposed technique has also been compared with stochastic techniques like LMS and NLMS (benchmark) techniques. The proposed technique shows good results against LMS. The comparison shows that the modified algorithm guarantees quite acceptable convergence with improved accuracy for higher dimensional identification problems.

An application of backtracking search optimization–based least squares support vector machine for prediction of short-term wind speed

2019 ◽  
Vol 44 (3) ◽  
pp. 266-281 ◽  
Author(s):  
Zhongda Tian ◽  
Yi Ren ◽  
Gang Wang
Keyword(s):  
Support Vector Machine ◽  
Wind Speed ◽  
Prediction Model ◽  
Least Squares ◽  
Support Vector ◽  
Short Term ◽  
Backtracking Search ◽  
Wind Speed Prediction ◽  
Search Optimization ◽  
Speed Prediction

Wind speed prediction is an important technology in the wind power field; however, because of their chaotic nature, predicting wind speed accurately is difficult. Aims at this challenge, a backtracking search optimization–based least squares support vector machine model is proposed for short-term wind speed prediction. In this article, the least squares support vector machine is chosen as the short-term wind speed prediction model and backtracking search optimization algorithm is used to optimize the important parameters which influence the least squares support vector machine regression model. Furthermore, the optimal parameters of the model are obtained, and the short-term wind speed prediction model of least squares support vector machine is established through parameter optimization. For time-varying systems similar to short-term wind speed time series, a model updating method based on prediction error accuracy combined with sliding window strategy is proposed. When the prediction model does not match the actual short-term wind model, least squares support vector machine trains and re-establishes. This model updating method avoids the mismatch problem between prediction model and actual wind speed data. The actual collected short-term wind speed time series is used as the research object. Multi-step prediction simulation of short-term wind speed is carried out. The simulation results show that backtracking search optimization algorithm–based least squares support vector machine model has higher prediction accuracy and reliability for the short-term wind speed. At the same time, the prediction performance indicators are also improved. The prediction result is that root mean square error is 0.1248, mean absolute error is 0.1374, mean absolute percentile error is 0.1589% and R2 is 0.9648. When the short-term wind speed varies from 0 to 4 m/s, the average value of absolute prediction error is 0.1113 m/s, and average value of absolute relative prediction error is 8.7111%. The proposed prediction model in this article has high engineering application value.

Sign in / Sign up

Export Citation Format

Share Document