東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Evolutionary optimization algorithms...

Raj, Ashish.

FindBook

Google Book

Amazon

博客來

Evolutionary optimization algorithms for nonlinear systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Evolutionary optimization algorithms for nonlinear systems./
作者:	Raj, Ashish.
面頁冊數:	90 p.
附註:	Source: Masters Abstracts International, Volume: 51-06.
Contained By:	Masters Abstracts International51-06(E).
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1537224
ISBN:	9781303074837

Evolutionary optimization algorithms for nonlinear systems.
Raj, Ashish.

Evolutionary optimization algorithms for nonlinear systems. - 90 p.

Source: Masters Abstracts International, Volume: 51-06.

Thesis (M.S.)--Utah State University, 2013.

Many real world problems in science and engineering can be treated as optimization problems with multiple objectives or criteria. The demand for fast and robust stochastic algorithms to cater to the optimization needs is very high. When the cost function for the problem is nonlinear and non-differentiable, direct search approaches are the methods of choice. Many such approaches use the greedy criterion, which is based on accepting the new parameter vector only if it reduces the value of the cost function. This could result in fast convergence, but also in misconvergence where it could lead the vectors to get trapped in local minima. Inherently, parallel search techniques have more exploratory power. These techniques discourage premature convergence and consequently, there are some candidate solution vectors which do not converge to the global minimum solution at any point of time. Rather, they constantly explore the whole search space for other possible solutions.

ISBN: 9781303074837Subjects--Topical Terms:

1669061
Engineering, Computer.

Evolutionary optimization algorithms for nonlinear systems.
LDR:02747nam 2200313 4500 001 1957252
005 20131202131322.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303074837
035 $a (UMI)AAI1537224
035 $a AAI1537224
040 $a UMI $c UMI
100 1 $a Raj, Ashish. $3 2092115
245 1 0 $a Evolutionary optimization algorithms for nonlinear systems.
300 $a 90 p.
500 $a Source: Masters Abstracts International, Volume: 51-06.
500 $a Adviser: Edmund A. Spencer.
502 $a Thesis (M.S.)--Utah State University, 2013.
520 $a Many real world problems in science and engineering can be treated as optimization problems with multiple objectives or criteria. The demand for fast and robust stochastic algorithms to cater to the optimization needs is very high. When the cost function for the problem is nonlinear and non-differentiable, direct search approaches are the methods of choice. Many such approaches use the greedy criterion, which is based on accepting the new parameter vector only if it reduces the value of the cost function. This could result in fast convergence, but also in misconvergence where it could lead the vectors to get trapped in local minima. Inherently, parallel search techniques have more exploratory power. These techniques discourage premature convergence and consequently, there are some candidate solution vectors which do not converge to the global minimum solution at any point of time. Rather, they constantly explore the whole search space for other possible solutions.
520 $a In this thesis, we concentrate on benchmarking three popular algorithms: Real-valued Genetic Algorithm (RGA), Particle Swarm Optimization (PSO), and Differential Evolution (DE). The DE algorithm is found to out-perform the other algorithms in fast convergence and in attaining low-cost function values. The DE algorithm is selected and used to build a model for forecasting auroral oval boundaries during a solar storm event. This is compared against an established model by Feldstein and Starkov. As an extended study, the ability of the DE is further put into test in another example of a nonlinear system study, by using it to study and design phase-locked loop circuits. In particular, the algorithm is used to obtain circuit parameters when frequency steps are applied at the input at particular instances.
590 $a School code: 0241.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0464
690 $a 0544
710 2 $a Utah State University. $b Electrical and Computer. $3 1022501
773 0 $t Masters Abstracts International $g 51-06(E).
790 1 0 $a Spencer, Edmund A., $e advisor
790 1 0 $a Winstead, Chris $e committee member
790 1 0 $a Chantem, Thidapat $e committee member
790 $a 0241
791 $a M.S.
792 $a 2013
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1537224