Superiorization: An optimization heuristic for medical physics

Abstract

Purpose: To describe and mathematically validate the superiorization methodology, which is a recently-developed heuristic approach to optimization, and to discuss its applicability to medical physics problem formulations that specify the desired solution (of physically given or otherwise obtained constraints) by an optimization criterion. Methods: The underlying idea is that many iterative algorithms for finding such a solution are perturbation resilient in the sense that, even if certain kinds of changes are made at the end of each iterative step, the algorithm still produces a constraints-compatible solution. This property is exploited by using permitted changes to steer the algorithm to a solution that is not only constraints-compatible, but is also desirable according to a specified optimization criterion. The approach is very general, it is applicable to many iterative procedures and optimization criteria used in medical physics. Results: The main practical contribution is a procedure for automatically producing from any given iterative algorithm its superiorized version, which will supply solutions that are superior according to a given optimization criterion. It is shown that if the original iterative algorithm satisfies certain mathematical conditions, then the output of its superiorized version is guaranteed to be as constraints-compatible as the output of the original algorithm, but it is superior to the latter according to the optimization criterion. This intuitive description is made precise in the paper and the stated claims are rigorously proved. Superiorization is illustrated on simulated computerized tomography data of a head cross-section and, in spite of its generality, superiorization is shown to be competitive to an optimization algorithm that is specifically designed to minimize total variation.

Accepted for publication in: Medical Physics

References in corpus (5)

• Perturbation Resilience and Superiorization of Iterative Algorithms
• Total variation superiorization schemes in proton computed tomography image reconstruction
• A constrained, total-variation minimization algorithm for low-intensity X-ray CT
• Ultra-fast treatment plan optimization for volumetric modulated arc therapy (VMAT)
• A Hierachical Evolutionary Algorithm for Multiobjective Optimization in IMRT

Cited by in corpus (20)

• Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods
• Total Variation Superiorized Conjugate Gradient Method for Image Reconstruction
• Can Linear Superiorization Be Useful for Linear Optimization Problems?
• Superiorized algorithm for reconstruction of CT images from sparse-view and limited-angle polyenergetic data
• A generalized projection-based scheme for solving convex constrained optimization problems
• Zero-Convex Functions, Perturbation Resilience, and Subgradient Projections for Feasibility-Seeking Methods
• A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
• Computerized Tomography with Total Variation and with Shearlets
• Multi-Group Multicast Beamforming by Superiorized Projections onto Convex Sets
• Linear Superiorization for Infeasible Linear Programming
• Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
• Hierarchical Convex Optimization by the Hybrid Steepest Descent Method with Proximal Splitting Operators -- Enhancements of SVM and Lasso
• Superiorized method for metal artifact reduction
• Superiorization of Preconditioned Conjugate Gradient Algorithms for Tomographic Image Reconstruction
• Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography
• Feasibility-based Fixed Point Networks
• Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery
• Strict Fejér Monotonicity by Superiorization of Feasibility-Seeking Projection Methods
• String-Averaging Projected Subgradient Methods for Constrained Minimization
• Projected Subgradient Minimization versus Superiorization