An algorithm based on resolvent operators for solving positively semidefinite variational inequalities (Q2472301)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5237664
Language Label Description Also known as
default for all languages
No label defined
    English
    An algorithm based on resolvent operators for solving positively semidefinite variational inequalities
    scientific article; zbMATH DE number 5237664

      Statements

      An algorithm based on resolvent operators for solving positively semidefinite variational inequalities (English)
      0 references
      0 references
      0 references
      0 references
      21 February 2008
      0 references
      From the authors' summary: A new monotonicity, \(M\)-monotonicity, is introduced, and the resolvent operator of an \(M\)-monotone operator is proved to be single-valued and Lipschitz continuous. With the help of the resolvent operator, the positive semidefinite general variational inequality (VI) problem \(VI(S_{+}^{n},F+G)\) is transformed into a fixed point problem for a nonexpansive mapping. Then a proximal point algorithm is constructed to solve the fixed point problem, which is proved to display global convergence under the condition that the mapping \(F\) in the variational inequality problem is strongly monotone and Lipschitz continuous. Furthermore, a convergent path Newton method is given for calculating \(\epsilon\)-solutions to the sequence of fixed point problems, rendering the proximal point algorithm implementable.
      0 references
      variational inequality
      0 references
      monotone operator
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references