Space-decomposition multiplier method for constrained minimization problems
| dc.citation.epage | 62 | en_US |
| dc.citation.issue | 1-2 | en_US |
| dc.citation.spage | 51 | en_US |
| dc.citation.volume | 41 | en_US |
| dc.citation.woscount | 1 | |
| 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:44:19Z | |
| dc.date.available | 2014-12-08T15:44:19Z | |
| dc.date.issued | 2001-01-01 | en_US |
| dc.description.abstract | In 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 space-decomposition multiplier method. Three examples are given to demonstrate this method and the potential constraint strategy. (C) 2001 Elsevier Science Ltd. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/S0898-1221(01)85005-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(01)85005-7 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/29935 | |
| dc.identifier.wosnumber | WOS:000166530500004 | |
| dc.language.iso | en_US | en_US |
| dc.subject | constrained minimization | en_US |
| dc.subject | decomposition method | en_US |
| dc.subject | multiplier method | en_US |
| dc.title | Space-decomposition multiplier method for constrained minimization problems | en_US |
| dc.type | Article | en_US |