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
DOI10.1080/02331934.2018.1474355zbMath1412.90164OpenAlexW2803428156MaRDI QIDQ4559404
Xiaopeng Zhao, Markus A. Köbis
Publication date: 3 December 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1474355
Related Items (6)
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 ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detection of multiple changes in a sequence of dependent variables
- Nonlinear total variation based noise removal algorithms
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Convex feasibility modeling and projection methods for sparse signal recovery
- On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
- Hilbertian convex feasibility problem: Convergence of projection methods
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Regularities and their relations to error bounds
- Total variation image deblurring with space-varying kernel
- Linear convergence of the Douglas–Rachford method for two closed sets
- The Dual Normal CHIP and Linear Regularity for Infinite Systems of Convex Sets in Banach Spaces
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- The MATLAB ODE Suite
- Projection methods: an annotated bibliography of books and reviews
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
- On Projection Algorithms for Solving Convex Feasibility Problems
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- The Implicit Convex Feasibility Problem and Its Application to Adaptive Image Denoising
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
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
