Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q162754
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zaslavski, Alexander J. / rank
 
Normal rank
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.1016/j.jat.2013.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988854313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of von Neumann's alternating projection algorithm for two sets / 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: Accelerating the convergence of the method of alternating projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbertian convex feasibility problem: Convergence of projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed outer projections, weighted averages and convex feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of projections for finding the common point of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradient projection algorithms and approximate solutions of convex feasibility problems / rank
 
Normal rank

Latest revision as of 00:29, 9 July 2024

scientific article
Language Label Description Also known as
English
Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
scientific article

    Statements

    Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (English)
    0 references
    10 September 2014
    0 references
    approximate solution
    0 references
    feasibility problem
    0 references
    Hilbert space
    0 references
    subgradient projection algorithm
    0 references

    Identifiers