A new \(CQ\) method for solving split feasibility problem (Q2266829): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768012 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative oblique projection onto convex sets and the split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A multiprojection algorithm using Bregman projections in a product space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the <i>CQ</i> algorithm for the split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4767830 / rank | |||
Normal rank |
Revision as of 11:29, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new \(CQ\) method for solving split feasibility problem |
scientific article |
Statements
A new \(CQ\) method for solving split feasibility problem (English)
0 references
26 February 2010
0 references
split feasibility problem (SFP)
0 references
projection method
0 references
convergence
0 references