Scholarlink

<p>We propose convergent algorithms based upon the hybrid idea for finding a minimizer of a quasiconvex function, which is also a solution of an implicit split convex feasibility problem involving fixed point set of a demicontractive mapping. The proposed algorithms are combinations between the projection algorithm for minimizing the quasiconvex function by using the normal subgradient and the CQ-algorithm coupling with the Krasnoselskii-Man iterative scheme for the fixed point problem. A modified Walras supply–demand equilibrium practical model with implicit supply and demand is presented and solved by the proposed algorithms.</p>

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

Parallel algorithms for finding common solutions to split convex feasibility and quasiconvex minimization problems

  • 期刊论文

  • 发表日期：

    2025年1月31日

查看全文
  • Tran Van Thang,
  • Le Dung Muu,
  • Nguyen Van Hong

摘要

We propose convergent algorithms based upon the hybrid idea for finding a minimizer of a quasiconvex function, which is also a solution of an implicit split convex feasibility problem involving fixed point set of a demicontractive mapping. The proposed algorithms are combinations between the projection algorithm for minimizing the quasiconvex function by using the normal subgradient and the CQ-algorithm coupling with the Krasnoselskii-Man iterative scheme for the fixed point problem. A modified Walras supply–demand equilibrium practical model with implicit supply and demand is presented and solved by the proposed algorithms.