摘要：

The intensities (i.e., number of protons in monitor unit [MU]) of deliverable proton spots need to be either zero or meet a minimum-MU (MMU) threshold, which is a nonconvex problem. Since the dose rate is proportionally associated with the MMU threshold, higher-dose-rate proton radiation therapy (RT) (e.g., efficient intensity modulated proton therapy (IMPT) and ARC proton therapy, and high-dose-rate-induced FLASH effect needs to solve the MMU problem with larger MMU threshold, which however makes the nonconvex problem more difficult to solve. This work will develop a more effective optimization method based on orthogonal matching pursuit (OMP) for solving the MMU problem with large MMU thresholds, compared to state-of-the-art methods, such as alternating direction method of multipliers (ADMM), proximal gradient descent method (PGD), or stochastic coordinate descent method (SCD). The new method consists of two essential components. First, the iterative convex relaxation (ICR) method is used to determine the active sets for dose-volume planning constraints and decouple the MMU constraint from the rest. Second, a modified OMP optimization algorithm is used to handle the MMU constraint: the non-zero spots are greedily selected via OMP to form the solution set to be optimized, and then a convex constrained subproblem is formed and can be conveniently solved to optimize the spot weights restricted to this solution set via OMP. During this iterative process, the new non-zero spots localized via OMP will be adaptively added to or removed from the optimization objective. The new method via OMP is validated in comparison with ADMM, PGD and SCD for high-dose-rate IMPT, ARC, and FLASH problems of large MMU thresholds, and the results suggest that OMP substantially improved the plan quality from PGD, ADMM and SCD in terms of both target dose conformality (e.g., quantified by max target dose and conformity index) and normal tissue sparing (e.g., mean and max dose). For example, in the brain case, the max target dose for IMPT/ARC/FLASH was 368.0%/358.3%/283.4% respectively for PGD, 154.4%/179.8%/150.0% for ADMM, 134.5%/130.4%/123.0% for SCD, while it was <120% in all scenarios for OMP; compared to PGD/ADMM/SCD, OMP improved the conformity index from 0.42/0.52/0.33 to 0.65 for IMPT and 0.46/0.60/0.61 to 0.83 for ARC. A new OMP-based optimization algorithm is developed to solve the MMU problems with large MMU thresholds, and validated using examples of IMPT, ARC, and FLASH with substantially improved plan quality from ADMM, PGD, and SCD.

收起

展开 