首页> 外文期刊>Journal of Global Optimization >A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
【24h】

A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces

机译:Hilbert空间中变分不等式的松弛投影分裂算法

获取原文
获取原文并翻译 | 示例
       

摘要

We introduce a relaxed-projection splitting algorithm for solving variational inequalities in Hilbert spaces for the sum of nonsmooth maximal monotone operators, where the feasible set is defined by a nonlinear and nonsmooth continuous convex function inequality. In our scheme, the orthogonal projections onto the feasible set are replaced by projections onto separating hyperplanes. Furthermore, each iteration of the proposed method consists of simple subgradient-like steps, which does not demand the solution of a nontrivial subproblem, using only individual operators, which exploits the structure of the problem. Assuming monotonicity of the individual operators and the existence of solutions, we prove that the generated sequence converges weakly to a solution.
机译:针对非光滑最大单调算子的和,我们引入了松弛投影分裂算法来求解希尔伯特空间中的变分不等式,其中可行集由非线性和非光滑的连续凸函数不等式定义。在我们的方案中,在可行集上的正交投影被在单独的超平面上的投影代替。此外,所提出方法的每次迭代都由简单的类似于子梯度的步骤组成,这些步骤仅要求使用单个算子就可以解决非平凡的子问题,从而利用了问题的结构。假设各个算子的单调性和解的存在,我们证明生成的序列弱收敛于一个解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号