[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_270":271},"routes/_layout",{"_11":190},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_73":74,"_75":76},"type","paper","id","paper_W2011108295","section","technologies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":-5,"_63":64,"_65":-5,"_66":67,"_68":30,"_69":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2011108295/technologies","siteBaseUrl","https://www.hugmap.com","sectionCount",2,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"A note on the CQ algorithm for the split feasibility problem\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2011108295/technologies\",\"@type\":\"ScholarlyArticle\",\"headline\":\"A note on the CQ algorithm for the split feasibility problem\",\"datePublished\":\"2005-09-16\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"Inverse Problems\"}},{\"@type\":\"CollectionPage\",\"name\":\"A note on the CQ algorithm for the split feasibility problem 相关技术\",\"description\":\"A note on the CQ algorithm for the split feasibility problem 在 HugMap 中的相关技术，共 2 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2011108295/technologies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"A note on the CQ algorithm for the split feasibility problem\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2011108295\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关技术\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2011108295/technologies\"}]}]}","name","A note on the CQ algorithm for the split feasibility problem","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2011108295\",\"doi\":\"10.1088/0266-5611/21/5/009\"}","properties","source","openalex","createdAt","2026-05-22T00:04:40.437462163","updatedAt","2026-05-22T00:04:40.43746389","doi","10.1088/0266-5611/21/5/009","arxivId","openalexId","W2011108295","title","abstractText","Let C and Q be nonempty closed convex sets in ℜN and ℜM, respectively, and A an M × N real matrix. The split feasibility problem (SFP) is to find x ∊ C with Ax ∊ Q, if such x exist. Byrne (2002 Inverse Problems 18 441–53) proposed a CQ algorithm with the following iterative scheme: where γ ∊ (0, 2/L), L denotes the largest eigenvalue of the matrix ATA, and PC and PQ denote the orthogonal projections onto C and Q, respectively. In his algorithm, Byrne assumed that the projections PC and PQ are easily calculated. However, in some cases it is impossible or needs too much work to exactly compute the orthogonal projection. Recently, Yang (2004 Inverse Problems 20 1261–6) presented a relaxed CQ algorithm, in which he replaced PC and PQ by and , that is, the orthogonal projections onto two halfspaces Ck and Qk, respectively. Clearly, the latter is easy to implement. One common advantage of the CQ algorithm and the relaxed CQ algorithm is that computation of the matrix inverses is not necessary. However, they use a fixed stepsize related to the largest eigenvalue of the matrix ATA, which sometimes affects convergence of the algorithms. In this paper, we present modifications of the CQ algorithm and the relaxed CQ algorithm by adopting Armijo-like searches. The modified algorithms need not compute the matrix inverses and the largest eigenvalue of the matrix ATA, and make a sufficient decrease of the objective function at each iteration. We also show convergence of the modified algorithms under mild conditions.","publishedDate","2005-09-16","publishedYear",2005,"venue","Inverse Problems","citationCount",273,"authors","keywords",[70,71,72],"pdfUrl","topVenue",false,"displayName","displayDescription","Optimization and Variational Analysis","Advanced Optimization Algorithms Research","Sparse and Compressive Sensing Techniques","mutations",[],"queries",[77],{"_78":79,"_80":81,"_82":83,"_84":85},"dehydratedAt",1781412058428,"state",{"_87":88,"_89":90,"_91":92,"_93":-5,"_94":95,"_96":95,"_97":95,"_98":-5,"_99":-5,"_100":67,"_35":101,"_102":103},"queryKey",[86,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2011108295\"]","portal","data",{"_19":20,"_104":105,"_106":107,"_108":109,"_110":111,"_18":112,"_62":113},"dataUpdateCount",1,"dataUpdatedAt",1781412058427,"error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[157,158,159],"events",[],"articles",[],[137,138],[114,115],{"_15":131,"_29":132,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":133,"_39":-5,"_40":41,"_42":134,"_44":135,"_121":136,"_51":-5,"_123":-5,"_124":-5,"_125":-5,"_60":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_130":-5,"_68":132,"_69":-5},{"_15":116,"_29":117,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":118,"_39":-5,"_40":41,"_42":119,"_44":120,"_121":122,"_51":-5,"_123":-5,"_124":-5,"_125":-5,"_60":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_130":-5,"_68":117,"_69":-5},"person_A5036516823","Biao Qu","{\"openalex\":\"A5036516823\",\"orcid\":\"0000-0001-5354-8043\"}","2026-05-22T00:04:41.180580998","2026-05-22T00:04:41.180583649","orcid","0000-0001-5354-8043","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5071551240","Naihua Xiu","{\"openalex\":\"A5071551240\",\"orcid\":\"0000-0002-3129-2005\"}","2026-05-22T00:04:42.176003922","2026-05-22T00:04:42.176005739","0000-0002-3129-2005",{"_15":153,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":154,"_39":-5,"_40":141,"_42":155,"_44":156,"_144":145,"_146":147,"_148":-5,"_149":150,"_151":-5,"_125":-5,"_152":-5,"_68":71,"_69":-5},{"_15":139,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":140,"_39":-5,"_40":141,"_42":142,"_44":143,"_144":145,"_146":147,"_148":-5,"_149":150,"_151":-5,"_125":-5,"_152":-5,"_68":70,"_69":-5},"tech_oa_T10545","{\"taxonomy_id\":\"tax_rd_T10545\"}","openalex_topics","2026-05-17T09:00:27.290565528","2026-05-17T09:00:27.2905666","techType","algorithm","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount","tech_oa_T10963","{\"taxonomy_id\":\"tax_rd_T10963\"}","2026-05-17T09:00:08.184199472","2026-05-17T09:00:08.184201336",{"_15":184,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":185,"_39":-5,"_40":41,"_42":186,"_44":187,"_164":165,"_166":-5,"_167":168,"_169":188,"_171":189,"_173":95,"_174":175,"_176":95,"_177":-5,"_68":71,"_69":-5},{"_15":178,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":179,"_39":-5,"_40":41,"_42":180,"_44":181,"_164":165,"_166":-5,"_167":168,"_169":182,"_171":183,"_173":95,"_174":175,"_176":95,"_177":-5,"_68":72,"_69":-5},{"_15":160,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":161,"_39":-5,"_40":41,"_42":162,"_44":163,"_164":165,"_166":-5,"_167":168,"_169":170,"_171":172,"_173":95,"_174":175,"_176":95,"_177":-5,"_68":70,"_69":-5},"tax_rd_T10545","{\"openalex_topic\":\"T10545\"}","2026-05-14T00:50:04.268888024","2026-05-23T12:29:41.297800447","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_1703","path","Physical Sciences/Computer Science/Computational Theory and Mathematics/Optimization and Variational Analysis","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T10500","{\"openalex_topic\":\"T10500\"}","2026-05-14T00:30:27.19960051","2026-05-23T12:39:17.252016307","tax_rd_2206","Physical Sciences/Engineering/Computational Mechanics/Sparse and Compressive Sensing Techniques","tax_rd_T10963","{\"openalex_topic\":\"T10963\"}","2026-05-14T00:28:11.354484131","2026-05-23T12:29:51.283917609","tax_rd_2612","Physical Sciences/Mathematics/Numerical Analysis/Advanced Optimization Algorithms Research",{"_73":191,"_75":192},[],[193],{"_78":194,"_80":195,"_82":196,"_84":197},1781412053902,{"_87":199,"_89":90,"_91":194,"_93":-5,"_94":95,"_96":95,"_97":95,"_98":-5,"_99":-5,"_100":67,"_35":101,"_102":103},[86,198],"[\"portal\",\"industries\"]","industries",[200,201,202,203,204,205,206,207,208,209,210,211],{"_15":263,"_29":264,"_31":-5,"_32":265,"_33":266,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":267,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":264,"_69":266},{"_15":259,"_29":260,"_31":-5,"_32":-5,"_33":261,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":262,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":260,"_69":261},{"_15":253,"_29":254,"_31":-5,"_32":255,"_33":256,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":257,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":254,"_69":256},{"_15":249,"_29":250,"_31":-5,"_32":-5,"_33":251,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":252,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":250,"_69":251},{"_15":245,"_29":246,"_31":-5,"_32":-5,"_33":247,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":248,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":246,"_69":247},{"_15":239,"_29":240,"_31":-5,"_32":241,"_33":242,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":243,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":240,"_69":242},{"_15":235,"_29":236,"_31":-5,"_32":-5,"_33":237,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":238,"_173":95,"_174":175,"_176":95,"_177":-5,"_68":236,"_69":237},{"_15":231,"_29":232,"_31":-5,"_32":-5,"_33":233,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":234,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":232,"_69":233},{"_15":227,"_29":228,"_31":-5,"_32":-5,"_33":229,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":230,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":228,"_69":229},{"_15":223,"_29":224,"_31":-5,"_32":-5,"_33":225,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":226,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":224,"_69":225},{"_15":219,"_29":220,"_31":-5,"_32":-5,"_33":221,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":222,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":220,"_69":221},{"_15":212,"_29":213,"_31":-5,"_32":-5,"_33":214,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_164":216,"_166":-5,"_167":90,"_169":217,"_171":218,"_173":95,"_174":67,"_176":95,"_177":-5,"_68":213,"_69":214},"tax_ind_smartphone","智能手机","Smartphone","manual","INDUSTRY","tax_ind_root","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[244],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[258],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[268,269],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_272":24},"SITE_BASE_URL"]

A note on the <i>CQ</i> algorithm for the split feasibility problem 论文

A note on the <i>CQ</i> algorithm for the split feasibility problem · 相关技术

相关技术