Averaging strings of sequential iterations for convex feasibility problems.
From MaRDI portal
Cited in
(44)- Projection and proximal point methods: Convergence results and counterexamples.
- A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- A real-time iterative projection scheme for solving the common fixed point problem and its applications
- Projected subgradient minimization versus superiorization
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
- Parallelization of reconstruction algorithms in three-dimensional electron microscopy
- CADD: a seamless solution to the domain decomposition problem of subdomain boundaries and cross-points
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Perturbation-resilient iterative methods with an infinite pool of mappings
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Linear convergence rates for extrapolated fixed point algorithms
- String-averaging incremental stochastic subgradient algorithms
- Compositions and convex combinations of averaged nonexpansive operators
- Nesterov perturbations and projection methods applied to IMRT
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Total variation superiorization in dual-energy CT reconstruction for proton therapy treatment planning
- String-averaging algorithms for convex feasibility with infinitely many sets
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
- Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
- Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators
- Approximate solutions of common fixed point problems with infinitely many operators
- Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications
- Accelerated under-relaxed parallel projection algorithms for convex set theoretic image recovery problem
- A Bregman–Kaczmarz method for nonlinear systems of equations
- Asymptotic regularity results for a viscosity version of Halpern-type iterations for coincidence problems
- Approximate solutions for three fixed point problems
- The Krasnoselskii-Mann method for common coincidence problems
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- An accelerated version of block cyclic subgradient projection method for solving convex feasibility problems
- Asymptotic regularity results for Halpern-type inexact iterations for coincidence problems
- General perturbation resilient dynamic string-averaging for inconsistent problems with superiorization
- Solving common fixed point problems with a countable family of operators
- Convergence of the string-averaging algorithm for common fixed point problems with a countable family of operators
- Optimization on solution sets of common fixed point problems with a countable family of maps
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
This page was built for publication: Averaging strings of sequential iterations for convex feasibility problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768013)
