Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Wayne L. Tabor"'
Publikováno v:
Applied Mathematical Modelling. 31(10):2095-2110
The focus of this paper is the optimization of complex multi-parameter systems. We consider systems in which the objective function is not known explicitly, and can only be evaluated through computationally intensive numerical simulation or through c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cebd7de2b1392f4e6fb196abe949807
Autor:
K. A. Ariyawansa, Wayne L. Tabor
Publikováno v:
Journal of Mathematical Analysis and Applications. 334:716-737
A family of algorithms for approximate solution of the bound-constrained minimization problem was introduced in [K.A. Ariyawansa, W.L. Tabor, A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a546cf008f8df32bf01b196257ef28e1
https://doi.org/10.1016/j.jmaa.2006.09.077
https://doi.org/10.1016/j.jmaa.2006.09.077
Autor:
Wayne L. Tabor, K. A. Ariyawansa
Publikováno v:
Computing. 70:25-39
Ariyawansa [2] has introduced a line search termination criterion for collinear scaling minimization algorithms. However, he verified that this criterion provides sufficient decrease only in the case of objective functions that satisfy certain strong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f12561766182a5c5782d8f1e1e0771b
https://doi.org/10.1007/s00607-002-1466-9
https://doi.org/10.1007/s00607-002-1466-9
Publikováno v:
8th Symposium on Multidisciplinary Analysis and Optimization.
This paper considers the optimization of complex multi-parameter systems in which the objective function is not known explicitly, and can only be evaluated either through costly physical experiments or through computationally intensive numerical simu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e3160d7d3262f7015d40d5ec3a66814
https://doi.org/10.2514/6.2000-4776
https://doi.org/10.2514/6.2000-4776
Autor:
Wayne L. Tabor, K. A. Ariyawansa
Publikováno v:
Journal of Computational and Applied Mathematics. (1):143-163
A family of algorithms for the approximate solution of the bound-constrained minimization problem is described. These algorithms employ the standard barrier method, with the inner iteration based on trust region methods. Local models are conic functi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9063d4647732f6a7c800c121338b159