Yair Censor The multiple-sets split feasibility problem requires to find a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. It can be a model for many inverse problems where constraints are … Read more
This is an experimental computational account of projection algorithms for the linear best approximation problem. We focus on the sequential and simultaneous versions of Dykstra’s algorithm and the Halpern-Lions-Wittmann-Bauschke algorithm for the best approximation problem from a point to the intersection of closed convex sets in the Euclidean space. These algorithms employ different iterative approaches … Read more
We study the behavior of subgradient projection algorithms for the quasiconvex feasibility problem of finding a point x^* in R^n that satisfies the inequalities f_i(x^*) less or equal 0, for all i=1,2,…,m, where all functions are continuous and quasiconvex. We consider the consistent case when the solution set is nonempty. Since the Fenchel-Moreau subdifferential might … Read more
We study a sequential algorithm for finding the projection of a given point onto the common fixed points set of a semigroup of nonexpansive operators in Hilbert space. The convergence of such an algorithm was previously established only for finitely many nonexpansive operators. Algorithms of this kind have been applied to the best approximation and … Read more
We study a steered sequential gradient algorithm which minimizes the sum of convex functions by proceeding cyclically in the directions of the negative gradients of the functions and using steered step-sizes. This algorithm is applied to the convex feasibility problem by minimizing a proximity function which measures the sum of the Bregman distances to the … Read more
The efficient delivery of intensity modulated radiation therapy (IMRT) depends on finding optimized beam intensity patterns that produce dose distributions, which meet given constraints for the tumor as well as any critical organs to be spared. Many optimization algorithms that are used for beamlet-based inverse planning are susceptible to large variations of neighboring intensities. Accurately … Read more
The prescribed goals of radiation treatment planning are often expressed in terms of dose-volume constraints. We present a novel formulation of a dose-volume constraint satisfaction search for the discretized radiation therapy model. This approach does not rely on any explicit cost function. The inverse treatment planning uses the aperture based approach with predefined, according to … Read more
Three-dimensional electron microscopy (3D-EM) is a powerful tool for visualizing complex biological systems. As any other imaging device, the electron microscope introduces a transfer function (called in this field the Contrast Transfer Function, CTF) into the image acquisition process that modulates the various frequencies of the signal. Thus, 3D reconstructions performed with these CTF-affected projections … Read more
We study iterative projection algorithms for the convex feasibility problem of finding a point in the intersection of finitely many nonempty, closed and convex subsets in the Euclidean space. We propose (without proof) an algorithmic scheme which generalizes both the string-averaging algorithm and the block-iterative projections (BIP) method with fixed blocks and prove convergence of … Read more
In this tutorial we discuss modeling issues in intensity modulated radiation therapy, contrasting the continuous model with the fully-discretized one and considering feasibility formulations versus optimization setups. We review briefly some mathematical optimization techniques for IMRT. These include global optimization, multi-objective optimization, linear and mixed integer programming and projection methods. Citationin: J.R. Palta and T.R. … Read more