Abstract
In this paper, we focus on a useful modification of the decomposition method by He et al. (Ref. 1). Experience on applications has shown that the number of iterations of the original method depends significantly on the penalty parameter. The main contribution of our method is that we allow the penalty parameter to vary automatically according to some self-adaptive rules. As our numerical simulations indicate, the modified method is more flexible and efficient in practice. A detailed convergence analysis of our method is also included.
Original language | English |
---|---|
Pages (from-to) | 415-429 |
Number of pages | 15 |
Journal | Journal of Optimization Theory and Applications |
Volume | 109 |
Issue number | 2 |
DOIs | |
Publication status | Published - May 2001 |
Scopus Subject Areas
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics
User-Defined Keywords
- Decomposition methods
- Monotone variational inequalities
- Self-adaptive rules