DocumentCode
2602206
Title
Solving the Linear Variational Inequality by Interval Evolution Algorithm
Author
Zhang, Ming ; Zhou, Yongquan
Author_Institution
Sch. of Sci., Dalian Fisheries Univ., Dalian, China
Volume
3
fYear
2009
fDate
21-22 May 2009
Firstpage
82
Lastpage
85
Abstract
This paper presents a solution to linear variational inequality by interval evolution strategies based on the question that iterative algorithm of traditional numerical computer can not satisfy parallel in solving variational inequality. The numerical solution used to solve linear variational inequality with interval evolution strategies sufficiently exerted the advantage of evolution strategies such as group search and global convergence, and it satisfies the question of parallel solute the linear variational inequality in engineering technique. The numerical computation results indicate that the algorithm offers an effective way to solve linear variational inequality, high convergence rate, high accuracy and robustness.
Keywords
convergence; evolutionary computation; iterative methods; search problems; variational techniques; engineering technique; global convergence; group search; interval evolution algorithm; iterative algorithm; linear variational inequality; Aquaculture; Computer science; Concurrent computing; Constraint optimization; Convergence of numerical methods; Design optimization; Iterative algorithms; Iterative methods; Robustness; Vectors; global convergence; interval evolution algorithm; parallel search; variational inequality;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Computing Science, 2009. ICIC '09. Second International Conference on
Conference_Location
Manchester
Print_ISBN
978-0-7695-3634-7
Type
conf
DOI
10.1109/ICIC.2009.226
Filename
5168809
Link To Document