Space-decomposition minimization method for large-scale minimization problems
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
88 | en_US |
dc.citation.issue |
7 | en_US |
dc.citation.spage |
73 | en_US |
dc.citation.volume |
37 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Liu, CS | en_US |
dc.contributor.author |
Tseng, CH | en_US |
dc.contributor.department |
機械工程學系 | zh_TW |
dc.contributor.department |
Department of Mechanical Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:46:45Z | |
dc.date.available |
2014-12-08T15:46:45Z | |
dc.date.issued |
1999-04-01 | en_US |
dc.description.abstract |
This paper introduces a set of new algorithms, called the Space-Decomposition Minimization (SDM) algorithms, that decomposes the minimization problem into subproblems. If the decomposed-space subproblems are not coupled to each other, they can be solved independently with any convergent algorithm; otherwise, iterative algorithms presented in this paper can be used. Furthermore, if the design space is further decomposed into one-dimensional decomposed spaces, the solution can be found directly using one-dimensional search methods. A hybrid algorithm that yields the benefits of the SDM algorithm and the conjugate gradient method is also given. An example that demonstrates application of SDM algorithm to the learning of a single-layer perceptron neural network is presented, and five large-scale numerical problems are used to test the SDM algorithms. The results obtained are compared with results from the conjugate gradient method. (C) 1999 Elsevier Science Ltd. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0898-1221(99)00088-7 | en_US |
dc.identifier.issn |
0898-1221 | en_US |
dc.identifier.journal |
COMPUTERS & MATHEMATICS WITH APPLICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0898-1221(99)00088-7 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/31435 | |
dc.identifier.wosnumber |
WOS:000079482100007 | |
dc.language.iso |
en_US | en_US |
dc.subject |
unconstrained minimization | en_US |
dc.subject |
decomposition method | en_US |
dc.subject |
direct-search method | en_US |
dc.subject |
large-scale problem | en_US |
dc.title |
Space-decomposition minimization method for large-scale minimization problems | en_US |
dc.type |
Article | en_US |
檔案
- 000079482100007.pdf (822.4 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Liu, C., & Tseng, C. (1999). Space-decomposition minimization method for large-scale minimization problems. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 37(7), 73–88. https://doi.org/10.1016/S0898-1221(99)00088-7
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31435