A domain decomposition method for a kind of optimization problems

In this paper, we are concerned with the monotone convergence of a multiplicative method for solving a kind of optimization problems. We show that the iterate sequence produced by the method converges to the solution of the problem monotonically.

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 146; no. 1; pp. 127 - 139
Main Authors Zeng, J.-P., Zhou, S.Z.
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 01.09.2002
Elsevier
Subjects
Applied sciences
Domain decomposition
Exact sciences and technology
Mathematical programming
Monotone convergence
Operational research and scientific management
Operational research. Management science
Optimization
Monotone convergence
Domain decomposition
Optimization
Variational inequality
Decomposition method
Optimization method
Problem solving
Elliptic operator
Monotonicity
Online AccessGet full text

Cover

More Information
Summary:In this paper, we are concerned with the monotone convergence of a multiplicative method for solving a kind of optimization problems. We show that the iterate sequence produced by the method converges to the solution of the problem monotonically.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/S0377-0427(02)00423-5