Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

DOI10.1016/j.jat.2013.07.012zbMath1303.90124OpenAlexW1988854313MaRDI QIDQ741092

Zaslavski, Alexander J.

Publication date: 10 September 2014

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2013.07.012

zbMATH Keywords

Hilbert spaceapproximate solutionfeasibility problemsubgradient projection algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Programming in abstract spaces (90C48)

Related Items (4)

A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Numerical methods for solving some matrix feasibility problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient projection algorithms and approximate solutions of convex feasibility problems
• Hilbertian convex feasibility problem: Convergence of projection methods
• Relaxed outer projections, weighted averages and convex feasibility
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Accelerating the convergence of the method of alternating projections
• Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
• The method of projections for finding the common point of convex sets
• Minimization of unsmooth functionals

This page was built for publication: Subgradient projection algorithms for convex feasibility problems in the presence of computational errors