Convergence of projection algorithms to approximate solutions of convex feasibility problems

zbMATH Open1369.65069MaRDI QIDQ2906313FDOQ2906313

Alexander J. Zaslavski

Publication date: 5 September 2012

Published in: Communications on Applied Nonlinear Analysis (Search for Journal in Brave)

Recommendations

• Hilbertian convex feasibility problem: Convergence of projection methods
• Solving for (approximate) convex feasibility under finite precision
• An algorithm for the convex feasibility problem
• Subgradient projection algorithms and approximate solutions of convex feasibility problems
• A strongly convergent parallel projection algorithm for convex feasibility problem

zbMATH Keywords

Hilbert spaceapproximate solutionfeasibility problemprojection algorithms

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)

Cited In (7)

• Title not available (Why is that?)
• An algorithm for the convex feasibility problem
• Asymptotic behavior of two algorithms for solving common fixed point problems
• Title not available (Why is that?)
• Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Incomplete projection algorithms for solving the convex feasibility problem

This page was built for publication: Convergence of projection algorithms to approximate solutions of convex feasibility problems

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