A generalized projection-based scheme for solving convex constrained optimization problems

Abstract

In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility problems by iteratively constraining the objective function from above until the feasibility problem is inconsistent. For each of the feasibility problems one may apply any of the existing projection methods for solving it. In particular, the scheme allows the use of subgradient projections and does not require exact projections onto the constraints sets as in existing similar methods. We also apply the newly introduced concept of superiorization to optimization formulation and compare its performance to our scheme. We provide some numerical results for convex quadratic test problems as well as for real-life optimization problems coming from medical treatment planning.

arXiv commentAccepted to publication in Computational Optimization and Applications

References in corpus (7)

• Perturbation Resilience and Superiorization of Iterative Algorithms
• Superiorization: An optimization heuristic for medical physics
• Projection Methods: An Annotated Bibliography of Books and Reviews
• A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
• Zero-Convex Functions, Perturbation Resilience, and Subgradient Projections for Feasibility-Seeking Methods
• Set intersection problems: Supporting hyperplanes and quadratic programming
• Linear Superiorization for Infeasible Linear Programming

Cited by in corpus (6)

• Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
• Accelerating two projection methods via perturbations with application to Intensity-Modulated Radiation Therapy
• Guaranteed $\epsilon$-optimal solutions with the linear optimizer ART3+O
• Projection Algorithms for Finite Sum Constrained Optimization
• A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters
• Differentiable Projection for Constrained Deep Learning