Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2011.613166 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987493814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed Alternating Projection Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic subgradient projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely convergent ``row-action'' method for the convex feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed projection method for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact implicit methods for monotone general variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation method for reconstructing objects from noisy X-rays / 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: Some recent advances in projection-type methods for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:35, 6 July 2024

scientific article
Language Label Description Also known as
English
Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
scientific article

    Statements

    Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    0 references
    alternating projection method
    0 references
    convex feasibility problem
    0 references
    relaxed technology
    0 references
    halfspace
    0 references
    0 references