Subgradient projection algorithms and approximate solutions of convex feasibility problems

DOI10.1007/s10957-012-0238-8zbMath1292.90288OpenAlexW2021769279MaRDI QIDQ364738

Zaslavski, Alexander J.

Publication date: 9 September 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0238-8

zbMATH Keywords

approximate solutionfeasibility problemcomputational errorssubgradient projection algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonlinear programming (90C30) Programming in abstract spaces (90C48) Approximation algorithms (68W25)

Related Items

The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Multivariate approximation by polynomial and generalized rational functions ⋮ 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 ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

Cites Work

• Hilbertian convex feasibility problem: Convergence of projection methods
• Relaxed outer projections, weighted averages and convex feasibility
• A finitely convergent ``row-action method for the convex feasibility problem
• Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• Perturbation resilience and superiorization of iterative algorithms
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex Analysis
• The method of projections for finding the common point of convex sets
• Minimization of unsmooth functionals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subgradient projection algorithms and approximate solutions of convex feasibility problems