Subgradient projection algorithms and approximate solutions of convex feasibility problems
From MaRDI portal
Recommendations
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- Solving for (approximate) convex feasibility under finite precision
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- A parallel approximate subgradient projection algorithm for convex feasibility problem
Cites work
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- 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?)
- 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
- Convex Analysis
- Cyclic subgradient projections
- Hilbertian convex feasibility problem: Convergence of projection methods
- Minimization of unsmooth functionals
- On Projection Algorithms for Solving Convex Feasibility Problems
- Perturbation resilience and superiorization of iterative algorithms
- Relaxed outer projections, weighted averages and convex feasibility
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The method of projections for finding the common point of convex sets
Cited in
(23)- Solving for (approximate) convex feasibility under finite precision
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Properties of subgradient projection iteration when applying to linear imaging system
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Approximate subgradients and coderivatives in \(R^ n\)
- Iterative algorithm for solving a class of convex feasibility problem
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
- scientific article; zbMATH DE number 11412 (Why is no real title available?)
- Multivariate approximation by polynomial and generalized rational functions
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- scientific article; zbMATH DE number 29728 (Why is no real title available?)
- Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem
- The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions
- Extensions of subgradient projection algorithms
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient.
- scientific article; zbMATH DE number 1264398 (Why is no real title available?)
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- An infeasible-point subgradient method using adaptive approximate projections
- scientific article; zbMATH DE number 3978823 (Why is no real title available?)
This page was built for publication: Subgradient projection algorithms and 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 Q364738)