咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
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... 详细信息
来源: 评论
On the convergence analysis of the gradient-cq algorithms for the split feasibility problem
收藏 引用
NUMERICAL algorithmS 2020年 第3期84卷 997-1017页
作者: Kesornprom, Suparat Pholasa, Nattawut Cholamjiak, Prasit Univ Phayao Sch Sci Phayao 56000 Thailand
In this work, based on the gradient method and the relaxed cq algorithm introduced by Lopez et al. (Inverse Probl.28, 085004,2012), we introduce two gradient-cq algorithms for solving the split feasibility problem in ... 详细信息
来源: 评论
Inertial relaxedcqalgorithms for solving a split feasibility problem in Hilbert spaces
收藏 引用
NUMERICAL algorithmS 2021年 第3期87卷 1075-1095页
作者: Sahu, D. R. Cho, Y. J. Dong, Q. L. Kashyap, M. R. Li, X. H. Banaras Hindu Univ Inst Sci Dept Math Varanasi 221005 Uttar Pradesh India Gyeongsang Natl Univ Dept Math Educ Jinju 52828 South Korea Univ Elect Sci & Technol China Sch Math Sci Chengdu 611731 Sichuan Peoples R China Key Lab Adv Signal Proc Tianjin 300300 Peoples R China Coll Sci Tianjin 300300 Peoples R China Civil Aviat Univ China Tianjin 300300 Peoples R China
The split feasibility problem is to find a pointx*with the property thatx*is an element of CandAx*is an element of Q, whereCandQare nonempty closed convex subsets of real Hilbert spacesXandY, respectively, andAis a bo... 详细信息
来源: 评论
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. ... 详细信息
来源: 评论
TWO SELF-ADAPTIVE cq algorithmS FOR THE SPLIT FEASIBILITY PROBLEM WITH MULTIPLE OUTPUT SETS
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS
收藏 引用
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS 2024年 2024卷 1-19页
作者: Zhang, Yaxuan Qin, Liqian Civil Aviat Univ China Coll Sci Tianjin 300300 Peoples R China
The split feasibility problem with multiple output sets is to find a point x* is an element of boolean AND(t)(i=1) C-i such that A(j)x* is an element of Q(j), j = 1, 2, ..., r where C-i subset of H and Q(j) subset of ... 详细信息
来源: 评论
A novel projection method for split feasibility problems with applications to compressive sensing
收藏 引用
COMPUTATIONAL & APPLIED MATHEMATICS 2023年 第4期42卷 1-20页
作者: Anh, Pham Ky Vinh, Nguyen The Vietnam Natl Univ Univ Sci Hanoi Vietnam Univ Transport & Commun Dept Math Anal 3 Cau Giay St Hanoi Vietnam
In this paper, by combining the hyperplane projection technique and gradient projection method with Polyak's stepsizes, we propose a novel projection algorithm to solve the split feasibility problem in Hilbert spa... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Best proximity points of (EP)-operators with qualitative analysis and simulation
收藏 引用
MATHEMATICS AND COMPUTERS IN SIMULATION 2021年 187卷 215-230页
作者: Usurelu, Gabriela Ioana Turcanu, Teodor Univ Politehn Bucuresti Dept Math & Informat Bucharest 060042 Romania
In this paper, we analyze a Thakur three-step iterative process adapted for the context of non-self-mappings. Based on this iteration, we state and prove the existence of best proximity points for the recently introdu... 详细信息
来源: 评论
General splitting methods with linearization for the split feasibility problem
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2021年 第4期79卷 813-836页
作者: Dong, Qiao-Li He, Songnian Rassias, Michael Th. Civil Aviat Univ China Coll Sci Tianjin 300300 Peoples R China Univ Zurich Inst Math CH-8057 Zurich Switzerland Moscow Inst Phys & Technol Dolgoprudnyi 141700 Russia
In this article, we introduce a general splitting method with linearization to solve the split feasibility problem and propose a way of selecting the stepsizes such that the implementation of the method does not need ... 详细信息
来源: 评论
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... 详细信息
来源: 评论