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

DOI10.1016/J.JAT.2013.07.012zbMATH Open1303.90124OpenAlexW1988854313MaRDI QIDQ741092FDOQ741092

Authors: Alexander J. Zaslavski 

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

Recommendations

• Subgradient projection algorithms and approximate solutions of convex feasibility problems
• The extragradient method for solving variational inequalities in the presence of computational errors
• Solving for (approximate) convex feasibility under finite precision
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors

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)

Cites Work

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

Cited In (10)

• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
• Title not available (Why is that?)
• Subgradient method with feasible inexact projections for constrained convex optimization problems
• Iterative algorithm for solving a class of convex feasibility problem
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
• Numerical methods for solving some matrix feasibility problems
• On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741092)