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
β¦ LIBER β¦
Space-decomposition multiplier method for constrained minimization problems
β Scribed by Chin-Sung Liu; Ching-Huan Tseng
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 749 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
ln this paper, a new multiplier method that decomposes variable space into decomposed spaces is introduced. This method allows constrained minimization problems to be decomposed into subproblems. A potential constraint strategy that uses only part of the constraint set in the decomposed-space subproblems is also presented to increase the efficiency of this new spacedecomposition multiplier method. Three examples are given to demonstrate this method and the potential constraint strategy. (~) 2001 Elsevier Science Ltd. All rights reserved.
π SIMILAR VOLUMES
Space-decomposition minimization method
β
Chin-Sung Liu; Ching-Hung Tseng
π
Article
π
1999
π
Elsevier Science
π
English
β 822 KB
Non-Monotone Space Decomposition Methods
β
S. Keesmann; W. MΓΆnch
π
Article
π
2002
π
John Wiley and Sons
β 110 KB
π 1 views
Decomposition branch and bound method fo
β
Thai Quynh Phong; Le Thi Hoai An; Pham Dinh Tao
π
Article
π
1995
π
Elsevier Science
π
English
β 393 KB
A feasible descent cone method for linea
β
E. de Klerk; J.A. Snyman
π
Article
π
1994
π
Elsevier Science
π
English
β 955 KB
A method of random search in constrained
β
D.V. Denisov
π
Article
π
1978
π
Elsevier Science
β 529 KB
The method of iterative regularization i
β
D.V. Denisov
π
Article
π
1978
π
Elsevier Science
β 658 KB