scientific article

Gabor T. Herman, Tommy Elfving, Yair Censor

Publication date: 9 April 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ A real-time iterative projection scheme for solving the common fixed point problem and its applications ⋮ CADD: a seamless solution to the domain decomposition problem of subdomain boundaries and cross-points ⋮ Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings ⋮ 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 ⋮ 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 ⋮ Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT) ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Unnamed Item ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ Compositions and convex combinations of averaged nonexpansive operators ⋮ A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Projected subgradient minimization versus superiorization ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Parallelization of reconstruction algorithms in three-dimensional electron microscopy ⋮ Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms ⋮ Nesterov perturbations and projection methods applied to IMRT ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ XCT image reconstruction by a modified superiorized iteration and theoretical analysis ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods