A domain decomposition method for a kind of optimization problems (Q697554): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An additive Schwarz method for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel solutions of variational inequality problems with nonlinear source terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigrid Algorithms for Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level Schwarz method for unilateral variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Monotone and Geometric Convergence of Schwarz Methods for Two-Sided Obstacle Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schwarz algorithm for the solution of variational inequalities with nonlinear source terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233210 / rank
 
Normal rank

Latest revision as of 17:09, 4 June 2024

scientific article
Language Label Description Also known as
English
A domain decomposition method for a kind of optimization problems
scientific article

    Statements

    A domain decomposition method for a kind of optimization problems (English)
    0 references
    0 references
    0 references
    17 September 2002
    0 references
    The authors are concerned with the monotone convergence of a multiplicative method for solving a kind of optimization problems. A multiplicative domain decomposition method is introduced and it is proved that the iterative sequence produced by the method converges to the solution of the problem monotonically. Two applications are given.
    0 references
    0 references
    domain decomposition
    0 references
    monotone convergence
    0 references
    optimization
    0 references
    numerical examples
    0 references