Decomposition method for a class of monotone variational inequality problems (Q1964713)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decomposition method for a class of monotone variational inequality problems
scientific article

    Statements

    Decomposition method for a class of monotone variational inequality problems (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2000
    0 references
    A monotone variational inequality is considered on a set \(\Omega= X\times Y\), where \(X\) and \(Y\) are constraints sets. The classical augmented Lagrangian method is advantageous and effective when \(Y= \mathbb{R}^m\). For some problems of interest, such as minimax problems, where both \(X\) and \(Y\) are proper subsets in \(\mathbb{R}^n\) and \(\mathbb{R}^m\), the original augmented Lagrangian method is no longer applicable. A new decomposition method is introduced for that case and its convergence is demonstrated. If \(Y= \mathbb{R}^m\), the new method reduces to the augmented Lagrangian method. Numerical results for the new method are presented.
    0 references
    numerical results
    0 references
    monotone variational inequality
    0 references
    minimax problems
    0 references
    decomposition method
    0 references
    convergence
    0 references
    augmented Lagrangian method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references