CORC  > 上海大学
Iterative algorithm for solving a class of convex feasibility problem
Li, Chunmei[1]; Duan, Xuefeng[2]; Lu, Linzhang[3]; Wang, Qingwen[4]; Shen, Shuqian[5]
刊名JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
2019
卷号352页码:352-367
关键词Convex feasibility problem Projection formula Relaxed alternating projection algorithm Quantum computation
ISSN号0377-0427
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/2163557
专题上海大学
作者单位1.[1]Guizhou Normal Univ, Sch Math Sci, Guiyang 550001, Guizhou, Peoples R China.
2.[2]Guilin Univ Elect Technol, Coll Math & Computat Sci, Guangxi Key Lab Cryptog & Informat Secur, Key Lab Data Anal & Computat,Guangxi Coll & Univ, Guilin 541004, Peoples R China.
3.[3]Guizhou Normal Univ, Sch Math Sci, Guiyang 550001, Guizhou, Peoples R China.
4.[4]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China.
5.[5]China Univ Petr, Coll Sci, Qingdao 257061, Peoples R China.
推荐引用方式
GB/T 7714
Li, Chunmei[1],Duan, Xuefeng[2],Lu, Linzhang[3],et al. Iterative algorithm for solving a class of convex feasibility problem[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS,2019,352:352-367.
APA Li, Chunmei[1],Duan, Xuefeng[2],Lu, Linzhang[3],Wang, Qingwen[4],&Shen, Shuqian[5].(2019).Iterative algorithm for solving a class of convex feasibility problem.JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS,352,352-367.
MLA Li, Chunmei[1],et al."Iterative algorithm for solving a class of convex feasibility problem".JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 352(2019):352-367.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace