Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
From MaRDI portal
Publication:6056101
DOI10.1111/itor.12929OpenAlexW3113812939MaRDI QIDQ6056101
Yair Censor, Aviv Gibali, Unnamed Author
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12929
common fixed pointscutter operatorsplit feasibilityCQ-algorithmradiation therapy treatment planningstring-averagingdose-volume constraintspercentage violation constraints
Related Items
String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Inertial accelerated steepest descent algorithm for generalized split common fixed point problems ⋮ Convergence of Extrapolated Dynamic StringAveraging Cutter Methods and Applications ⋮ Alternated inertial algorithms for split feasibility problems ⋮ The generalized modular string averaging procedure and its applications to iterative methods for solving various nonlinear operator theory problems ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Iterative methods for fixed point problems in Hilbert spaces
- The method of alternating relaxed projections for two nonconvex sets
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Algorithms for the common solution of the split variational inequality problems and fixed point problems with applications
- General method for solving the split common fixed point problem
- Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy
- Landweber-type operator and its properties
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- On the string averaging method for sparse common fixed‐point problems
- The split common fixed-point problem for demicontractive mappings
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- First-Order Methods in Optimization
- The Split Common Null Point Problem
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Strong convergence for generalized multiple-set split feasibility problem
- FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
- Split equilibrium problems for related games and applications to economic theory
- Sparse Approximation via Penalty Decomposition Methods
- Convex programming in Hilbert space
This page was built for publication: Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning