The following pages link to Yair Censor (Q228633):
Displaying 50 items.
- (Q197551) (redirect page) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- A von Neumann alternating method for finding common solutions to variational inequalities (Q435880) (← links)
- Extrapolation and local acceleration of an iterative process for common fixed point problems (Q442508) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- Common solutions to variational inequalities (Q452274) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- The subgradient extragradient method for solving variational inequalities in Hilbert space (Q535068) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- Algorithms for the split variational inequality problem (Q663488) (← links)
- Optimization of Burg's entropy over linear constraints (Q756379) (← links)
- Interval-constrained matrix balancing (Q758125) (← links)
- Parallel computing with block-iterative image reconstruction algorithms (Q803769) (← links)
- The primal-dual algorithm as a constraint-set-manipulation device (Q811396) (← links)
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem (Q860662) (← links)
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin (Q1040681) (← links)
- An automatic relaxation method for solving interval linear inequalities (Q1060533) (← links)
- Haifa 1985 conference on matrix theory (Q1085237) (← links)
- A computational solution of the inverse problem in radiation-therapy treatment planning (Q1098573) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- Necessary conditions for Pareto optimality in simultaneous Chebyshev best approximation (Q1136012) (← links)
- An iterative row-action method for interval convex programming (Q1138236) (← links)
- New methods for linear inequalities (Q1162118) (← links)
- An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
- Strong underrelaxation in Kaczmarz's method for inconsistent systems (Q1166890) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- Pareto optimality in multiobjective problems (Q1233815) (← links)
- General conservative FK-spaces and an extended notion of conullity (Q1239869) (← links)
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators (Q1290609) (← links)
- Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces (Q1343646) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems (Q1360219) (← links)
- Inhomogeneous turbulent field diagnostics by distance-dependent tomographic reconstruction techniques (Q1375902) (← links)
- On the maximal number of solutions of a problem in linear inequalities (Q1393454) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← links)
- Derivative-free superiorization with component-wise perturbations (Q1736407) (← links)
- Iterative algorithms with seminorm-induced oblique projections (Q1811861) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- Summed squared distance error reduction by simultaneous multiprojections and applications (Q1855154) (← links)
- The least-intensity feasible solution for aperture-based inverse planning in radiation therapy (Q1870398) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- An analysis of the superiorization method via the principle of concentration of measure (Q2041036) (← links)
- Derivative-free superiorization: principle and algorithm (Q2048824) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
