Derivative-Free Superiorization: Principle and Algorithm
Yair Censor, Edgar Gardu\~no, Elias S. Helou, Gabor T. Herman

TL;DR
This paper introduces a derivative-free superiorization method that adapts feasibility-seeking algorithms to reduce target functions without derivatives, demonstrated on image reconstruction data.
Contribution
It develops a novel derivative-free superiorization algorithm that can handle target functions without derivatives, enhancing applicability in constrained optimization.
Findings
The derivative-free superiorization algorithm effectively reduces target function values.
Proximity-target curves help compare iterative methods for specific problems.
Numerical experiments show the proposed method's advantage over existing approaches.
Abstract
The superiorization methodology is intended to work with input data of constrained minimization problems, that is, a target function and a set of constraints. However, it is based on an antipodal way of thinking to what leads to constrained minimization methods. Instead of adapting unconstrained minimization algorithms to handling constraints, it adapts feasibility-seeking algorithms to reduce (not necessarily minimize) target function values. This is done by inserting target-function-reducing perturbations into a feasibility-seeking algorithm while retaining its feasibility-seeking ability and without paying a high computational price. A superiorized algorithm that employs component-wise target function reduction steps is presented. This enables derivative-free superiorization (DFS), meaning that superiorization can be applied to target functions that have no calculable partial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
