✦ LIBER ✦

Parallel Synchronous and Asynchronous Space-Decomposition Algorithms for Large-Scale Minimization Problems

✍ Scribed by Chin-Sung Liu; Ching-Huan Tseng

Book ID: 110266918
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 471 KB
Volume: 17
Category: Article
ISSN: 0926-6003
DOI: 10.1023/a:1008731209637

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space-decomposition minimization method

Space-decomposition minimization method for large-scale minimization problems

✍ Chin-Sung Liu; Ching-Hung Tseng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 822 KB

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; o

Parallel asynchronous algorithms for opt

Parallel asynchronous algorithms for optimal control of large-scale dynamic systems

✍ S. S. Abdelwahed; M. F. Hassan; M. A. Sultan 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

This paper presents two parallel asynchronous algorithms for the solution of the optimal control problem of linear large-scale dynamic systems. These algorithms are based on the prediction concept. The first one adopts the interaction prediction approach and the second is based upon the costate pred

Decomposition and parallelization strate

Decomposition and parallelization strategies for solving large-scale MDO problems

✍ M. Grauer; Hans A. Eschenauer 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract During previous years, structural optimization has been recognized as a useful tool within the discriptines of engineering and economics. However, the optimization of large‐scale systems or structures is impeded by an immense solution effort. This was the reason to start a joint researc

Improvement of genetic algorithms with d

Improvement of genetic algorithms with decomposition procedures for large-scale multiobjective multidimensional 0-1 knapsack problems incorporating fuzzy goals

✍ Kosuke Kato; Masatoshi Sakawa; Toshinori Ikegame 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

PO-based characteristic basis finite ele

PO-based characteristic basis finite element method (CBFEM-PO)—A parallel, iteration-free domain decomposition algorithm using perfectly matched layers for large-scale electromagnetic scattering problems

✍ Ozlem Ozgun; Raj Mittra; Mustafa Kuzuoglu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 700 KB

## Abstract In this article, we introduce a new type of Characteristic Basis Finite Element Method (CBFEM), which is based on the concepts of Physical Optics (PO) and Perfectly Matched Layers (PMLs), for solving large‐scale electromagnetic scattering problems in a rigorous and efficient manner. Thi

[Smart Innovation, Systems and Technolog

[Smart Innovation, Systems and Technologies] Intelligent Decision Technologies Volume 10 || A GPU-Based Parallel Algorithm for Large Scale Linear Programming Problem

✍ Watada, Junzo; Phillips-Wren, Gloria; Jain, Lakhmi C.; Howlett, Robert J. 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 252 KB

Intelligent Decision Technologies (IDT) seeks an interchange of research on intelligent systems and intelligent technologies which enhance or improve decision making in industry, government and academia. The focus is interdisciplinary in nature, and includes research on all aspects of intelligent de