咨询与建议

限定检索结果

文献类型

  • 26 篇 期刊文献
  • 2 篇 会议

馆藏范围

  • 28 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 27 篇 理学
    • 27 篇 数学
    • 3 篇 物理学
  • 7 篇 管理学
    • 7 篇 管理科学与工程(可...
  • 3 篇 工学
    • 2 篇 计算机科学与技术...
    • 1 篇 力学(可授工学、理...
    • 1 篇 信息与通信工程
    • 1 篇 软件工程

主题

  • 28 篇 cq algorithm
  • 21 篇 split feasibilit...
  • 4 篇 weak convergence
  • 3 篇 hilbert space
  • 3 篇 projection
  • 3 篇 linear convergen...
  • 2 篇 variable stepsiz...
  • 2 篇 self-adaptive
  • 2 篇 conjugate gradie...
  • 2 篇 bregman projecti...
  • 2 篇 armijo-line sear...
  • 1 篇 intersection of ...
  • 1 篇 nonexpansive-map...
  • 1 篇 sparse recovery ...
  • 1 篇 best proximity p...
  • 1 篇 variable-step
  • 1 篇 self-adaptive st...
  • 1 篇 inverse problems
  • 1 篇 p-property
  • 1 篇 hyperplane proje...

机构

  • 7 篇 luoyang normal u...
  • 4 篇 civil aviat univ...
  • 1 篇 china marine dev...
  • 1 篇 naval acad armam...
  • 1 篇 tianjin polytech...
  • 1 篇 univ elect sci &...
  • 1 篇 kaohsiung med un...
  • 1 篇 china med univ c...
  • 1 篇 department of ma...
  • 1 篇 aligarh muslim u...
  • 1 篇 vietnam natl uni...
  • 1 篇 shenzhen univ co...
  • 1 篇 zhejiang univ te...
  • 1 篇 king mongkuts un...
  • 1 篇 qufu normal univ...
  • 1 篇 univ zurich inst...
  • 1 篇 department of ap...
  • 1 篇 naval aviat univ...
  • 1 篇 china med univ c...
  • 1 篇 king mongkuts un...

作者

  • 5 篇 wang fenghui
  • 4 篇 yu hai
  • 3 篇 zhan wanrong
  • 2 篇 dong qiao-li
  • 2 篇 zhou jianjun
  • 2 篇 zhang yaxuan
  • 2 篇 kumam poom
  • 2 篇 wang risheng
  • 2 篇 wang peiyuan
  • 2 篇 chen jie
  • 2 篇 yao jen-chih
  • 1 篇 xu hong-kun
  • 1 篇 abubakar jamilu
  • 1 篇 usurelu gabriela...
  • 1 篇 sitthithakerngki...
  • 1 篇 hu yaohua
  • 1 篇 pham thi hoai
  • 1 篇 ma xiaojun
  • 1 篇 deepho jitsupa
  • 1 篇 rudong chen

语言

  • 24 篇 英文
  • 4 篇 其他
检索条件"主题词=CQ algorithm"
28 条 记 录,以下是21-30 订阅
排序:
Polyak's gradient method for split feasibility problem constrained by level sets
收藏 引用
NUMERICAL algorithmS 2018年 第3期77卷 925-938页
作者: Wang, Fenghui Luoyang Normal Univ Dept Math Luoyang 471022 Peoples R China
In this paper, we are concerned with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Polyak's gradient method, we get a new and simple algorithm for su... 详细信息
来源: 评论
Linear convergence of cq algorithms and applications in gene regulatory network inference
收藏 引用
INVERSE PROBLEMS 2017年 第5期33卷 1-1页
作者: Wang, Jinhua Hu, Yaohua Li, Chong Yao, Jen-Chih Zhejiang Univ Technol Dept Math Hangzhou 310032 Zhejiang Peoples R China Shenzhen Univ Coll Math & Stat Shenzhen 518060 Peoples R China Zhejiang Univ Sch Math Sci Hangzhou 310027 Zhejiang Peoples R China China Med Univ Ctr Gen Educ Taichung 40402 Taiwan Kaohsiung Med Univ Res Ctr Nonlinear Anal & Optimizat Kaohsiung 807 Taiwan
In the present paper, we consider the varying stepsize cq algorithm for solving the split feasibility problem in Hilbert spaces, investigate the linear convergence issue and explore an application in systems biology. ... 详细信息
来源: 评论
Modified Hybrid Steepest Method for the Split Feasibility Problem in Image Recovery of Inverse Problems
收藏 引用
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2017年 第4期38卷 507-522页
作者: Sitthithakerngkiet, Kanokwan Deepho, Jitsupa Kumam, Poom King Mongkuts Univ Technol North Bangkok Fac Sci Appl Dept Math Nonlinear Dynam Anal Res Ctr Bangkok Thailand King Mongkuts Univ Technol North Bangkok Fac Sci Energy & Environm Rayong Thailand King Mongkuts Univ Technol Thonburi Dept Math KMUTT Fixed Point Res Lab Fac Sci Bangkok Thailand King Mongkuts Univ Technol Thonburi KMUTT Fixed Point Theory & Applicat Res Grp Theoret & Computat Sci Ctr Fac Sci Bangkok Thailand China Med Univ China Med Univ Hosp Dept Med Res Taichung Taiwan
In this paper, we regard the cq algorithm as a fixed point algorithm for averaged mapping, and also try to study the split feasibility problem by the following hybrid steepest method;where {(n)}(0,1). It is noted that... 详细信息
来源: 评论
Accelerated Mann and cq algorithms for finding a fixed point of a nonexpansive mapping
收藏 引用
FIXED POINT THEORY AND APPLICATIONS 2015年 第1期2015卷 1-12页
作者: Dong, Qiao-Li Yuan, Han-bo Civil Aviat Univ China Coll Sci Tianjin 300300 Peoples R China Civil Aviat Univ China Tianjin Key Lab Adv Signal Proc Tianjin 300300 Peoples R China
The purpose of this paper is to present accelerations of the Mann and cq algorithms. We first apply the Picard algorithm to the smooth convex minimization problem and point out that the Picard algorithm is the steepes... 详细信息
来源: 评论
An Accelerated Iteration algorithm for Reconstructing Sparse Compressed Sensing Data  2
An Accelerated Iteration Algorithm for Reconstructing Sparse...
收藏 引用
2nd IEEE International Conference on Computer and Communications (ICCC)
作者: Wang, Peiyuan Zhou, Jianjun Wang, Risheng Chen, Jie Naval Acad Armamen Postdoctoral Workstn Beijing Peoples R China Naval Aviat Inst Huludao Peoples R China Naval Acad Armamen Beijing Peoples R China
The variable stepsize methods are effective to accelerate many iteration algorithms, one aim of them is to construct an adaptive stepsize, which has more simple and efficient format. The purpose of this paper is to in... 详细信息
来源: 评论
A Relaxed cq algorithm for Solving Split Feasibility Problem
A Relaxed CQ Algorithm for Solving Split Feasibility Problem
收藏 引用
2011 International Conference on Control, Automation and Systems Engineering(CASE)
作者: Jing Sun Rudong Chen Department of Mathematics Tianjin Polytechnic University
The split feasibility problem(SFP) is to find a point x ∈ C such that Ax ∈ Q,where A:H1 → H2 is a bounded linear operator,and C and Q be nonempty closed convex subset of Hilbert space H1 and H2,*** this paper,we pr... 详细信息
来源: 评论
A NEW algorithm FOR SOLVING THE MULTIPLE-SETS SPLIT FEASIBILITY PROBLEM IN BANACH SPACES
收藏 引用
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2014年 第1期35卷 99-110页
作者: Wang, Fenghui Luoyang Normal Univ Dept Math Luoyang 471022 Peoples R China
In this article, we propose a new algorithm for solving the multiple-sets split feasibility problem in Banach spaces. Under some mild conditions we establish the norm convergence of the proposed algorithm. One advanta... 详细信息
来源: 评论
A variable Krasnosel'skii-Mann algorithm and the multiple-set split feasibility problem
收藏 引用
INVERSE PROBLEMS 2006年 第6期22卷 2021-2034页
作者: Xu, Hong-Kun Univ KwaZulu Natal Sch Math Sci ZA-4000 Durban South Africa
A variable Krasnosel'skii-Mann algorithm generates a sequence {x(n)} via the formula x(n+1) = (1 - alpha(n))x(n) + alpha(n)T(n)x(n), where {alpha(n)} is a sequence in [0, 1] and {T-n} is a sequence of nonexpansive... 详细信息
来源: 评论