| Type of Document |
Dissertation |
| Author |
Vugrin, Kay Ellen White
|
| Author's Email Address |
kwvugri@sandia.gov |
| URN |
etd-05032005-133146 |
| Title |
On the Effects of Noise on Parameter Identification Optimization Problems |
| Degree |
PhD |
| Department |
Mathematics |
| Advisory Committee |
| Advisor Name |
Title |
| Borggaard, Jeffrey T. |
Committee Chair |
| Cliff, Eugene M. |
Committee Member |
| Herdman, Terry L. |
Committee Member |
| Iliescu, Traian |
Committee Member |
| Sun, Shu-Ming |
Committee Member |
|
| Keywords |
- Shuffled Complex Evolution Method
- Nelder-Mead Algorithm
- Inverse Problem
|
| Date of Defense |
2005-04-04 |
| Availability |
unrestricted |
Abstract
The calibration of model parameters is an important step in model development. Commonly, system output is measured, and model parameters are iteratively varied until the model output is a good match to the measured system output. Optimization algorithms are often used to identify the model parameter values. The presence of noise is difficult to avoid when physical processes are used to calibrate models due to measurement error, model structure error, and errors arising from numerical techniques and approximate solutions. Our study focuses on the effects of noise in parameter identification optimization problems. We generate six test problems, including five perturbations of a smooth problem. A previously studied groundwater parameter identification problem serves as our seventh test problem. We test the Nelder-Mead Algorithm, a combination of the Nelder-Mead Algorithm and Simulated Annealing, and the Shuffled Complex Evolution Method on these test problems. Comparison of optimization results for these problems reveals the effects of noise on optimization performance,
including an increase in fitness values and a decrease in the number of fit evaluations. We vary the values of the internal algorithmic parameters to determine the effects of different values and present numerical results that indicate that changing the values of the algorithmic parameters can cause profound differences in optimization results for all three algorithms. A variation of the generally accepted parameter values for the Nelder-Mead Algorithm is recommended, and we determine that the Nelder-Mead/Simulated Annealing Hybrid and Shuffled Complex Evolution Method are too problem dependent for general recommendations for parameter values. Finally, we prove new convergence results for the Nelder-Mead/Simulated
Annealing Hybrid in both smooth and noisy cases.
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds)
|
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
| |
vugrin_dissertation.pdf |
1.01 Mb |
00:04:41 |
00:02:24 |
00:02:06 |
00:01:03 |
00:00:05 |
|
