Liu Xinmin, Pelizzari Charles, Belcher Andrew H, Grelewicz Zachary, Wiersma Rodney D
Department of Radiation and Cellular Oncology, The University of Chicago, Chicago, IL, 60637, USA.
Med Phys. 2017 Apr;44(4):1246-1256. doi: 10.1002/mp.12165.
Most radiation therapy optimization problems can be formulated as an unconstrained problem and solved efficiently by quasi-Newton methods such as the Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm. However, several next generation planning techniques such as total variation regularization- based optimization and MV+kV optimization, involve constrained or mixed-norm optimization, and cannot be solved by quasi-Newton methods. Using standard optimization algorithms on such problems often leads to prohibitively long optimization times and large memory requirements. This work investigates the use of a recently developed proximal operator graph solver (POGS) in solving such radiation therapy optimization problems.
Radiation therapy inverse treatment planning was formulated as a graph form problem, and the proximal operators of POGS for quadratic optimization were derived. POGS was exploited for the first time to impose hard dose constraints along with soft constraints in the objective function. The solver was applied to several clinical treatment sites (TG119, liver, prostate, and head&neck), and the results were compared to the solutions obtained by other commercial and non-commercial optimizers.
For inverse planning optimization with nonnegativity box constraints on beamlet intensity, the speed of POGS can compete with that of LBFGSB in some situations. For constrained and mixed-norm optimization, POGS is about one or two orders of magnitude faster than the other solvers while requiring less computer memory.
POGS was used for solving inverse treatment planning problems involving constrained or mixed-norm formulation on several example sites. This approach was found to improve upon standard solvers in terms of computation speed and memory usage, and is capable of solving traditionally difficult problems, such as total variation regularization-based optimization and combined MV+kV optimization.
大多数放射治疗优化问题可被表述为无约束问题,并通过诸如有限内存布罗伊登-弗莱彻-戈德法布-沙诺(L-BFGS)算法等拟牛顿法有效求解。然而,一些下一代计划技术,如基于总变差正则化的优化和MV+kV优化,涉及约束或混合范数优化,无法通过拟牛顿法求解。在此类问题上使用标准优化算法通常会导致过长的优化时间和巨大的内存需求。本研究探讨使用最近开发的近端算子图求解器(POGS)来解决此类放射治疗优化问题。
将放射治疗逆向治疗计划表述为图形式问题,并推导了POGS用于二次优化的近端算子。首次利用POGS在目标函数中施加硬剂量约束以及软约束。将该求解器应用于多个临床治疗部位(TG119、肝脏、前列腺和头颈部),并将结果与其他商业和非商业优化器得到的解进行比较。
对于在子野强度上具有非负盒约束的逆向计划优化,在某些情况下POGS的速度可与LBFGSB相媲美。对于约束和混合范数优化,POGS比其他求解器快约一到两个数量级,同时所需计算机内存更少。
POGS用于解决多个示例部位上涉及约束或混合范数公式的逆向治疗计划问题。发现该方法在计算速度和内存使用方面优于标准求解器,并且能够解决传统上困难的问题,如基于总变差正则化的优化和联合MV+kV优化。