Space-decomposition minimization method for large-scale minimization problems

檔案

日期

1999-04-01

類型

期刊名稱

COMPUTERS & MATHEMATICS WITH APPLICATIONS

卷期與頁次

第 37 卷第 7 期,頁 73–88

ISSN

0898-1221

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31435