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

DOI10.1016/J.JAT.2013.07.012MaRDI QIDQ741092zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(18)

• Solving for (approximate) convex feasibility under finite precision
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
• The extragradient method for solving variational inequalities in the presence of computational errors
• A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
• scientific article; zbMATH DE number 6285845 (Why is no real title available?)
• Subgradient method with feasible inexact projections for constrained convex optimization problems
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
• Iterative algorithm for solving a class of convex feasibility problem
• The projected subgradient algorithm in convex optimization
• On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
• Subgradient projection algorithms and approximate solutions of convex feasibility problems
• Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
• The subgradient method for solving variational inequalities with computational errors in a Hilbert space
• Numerical methods for solving some matrix feasibility problems
• Numerical optimization with computational errors
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
• The extragradient method for finding a common solution of a finite family of variational inequalities and a finite family of fixed point problems in the presence of computational errors

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)