Scholarlink

<p>In this paper, we propose a random and cyclic projection algorithm for solving variational inequality problems with special structure where the underlying mapping is strongly pseudomonotone and <i>L</i>-Lipschitz continuous and the constraint set is the intersection of a large number of simple closed convex sets. Compared with some existing incremental constraint projection algorithms, the proposed algorithm has two notable advantages: Its global convergence can be guaranteed under the assumption that <i>F</i> is strongly pseudomonotone, not strongly monotone or monotone plus; It just computes one projection onto a&#xa0;halfspace rather than two or more times projections onto the full or single constraint set at each iteration. Computational experiments are also reported to illustrate the effectiveness of the proposed algorithm.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Random and cyclic projection algorithms for strongly pseudomonotone variational inequalities

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月13日

查看全文
  • Wanyu Wang,
  • Beibei Ma

摘要

In this paper, we propose a random and cyclic projection algorithm for solving variational inequality problems with special structure where the underlying mapping is strongly pseudomonotone and L-Lipschitz continuous and the constraint set is the intersection of a large number of simple closed convex sets. Compared with some existing incremental constraint projection algorithms, the proposed algorithm has two notable advantages: Its global convergence can be guaranteed under the assumption that F is strongly pseudomonotone, not strongly monotone or monotone plus; It just computes one projection onto a halfspace rather than two or more times projections onto the full or single constraint set at each iteration. Computational experiments are also reported to illustrate the effectiveness of the proposed algorithm.