On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
From MaRDI portal
Publication:4559404
Recommendations
- scientific article; zbMATH DE number 7213713
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- A strongly convergent parallel projection algorithm for convex feasibility problem
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 65765 (Why is no real title available?)
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Convex feasibility modeling and projection methods for sparse signal recovery
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
- Detection of multiple changes in a sequence of dependent variables
- Hilbertian convex feasibility problem: Convergence of projection methods
- Linear convergence of the Douglas-Rachford method for two closed sets
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Nonlinear total variation based noise removal algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Projection methods: an annotated bibliography of books and reviews
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Regularities and their relations to error bounds
- The MATLAB ODE Suite
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- The dual normal CHIP and linear regularity for infinite systems of convex sets in Banach spaces
- The implicit convex feasibility problem and its application to adaptive image denoising
- Total variation image deblurring with space-varying kernel
Cited in
(8)- On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints
- Multivariate approximation by polynomial and generalized rational functions
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- The implicit convex feasibility problem and its application to adaptive image denoising
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions
This page was built for publication: On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559404)
