Derivative-free superiorization: principle and algorithm
From MaRDI portal
Publication:2048824
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 derivatives or subgradients. The numerical behavior of our derivative-free superiorization algorithm is illustrated on a data set generated by simulating a problem of image reconstruction from projections. We present a tool (we call it a proximity-target curve) for deciding which of two iterative methods is "better" for solving a particular problem. The plots of proximity-target curves of our experiments demonstrate the advantage of the proposed derivative-free superiorization algorithm.
Recommendations
- Derivative-free superiorization with component-wise perturbations
- Derivative free optimization in higher dimension
- A derivative-free algorithm for unconstrained optimization
- Derivative-free optimal iterative methods
- Derivative-Free Optimization
- Algorithm for forming derivative-free optimal methods
- A derivative-free algorithm for least-squares minimization
- Derivative-free optimization methods
- A derivative-free algorithm for bound constrained optimization
- Derivative-free optimization via proximal point methods
Cites work
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- A progressive barrier for derivative-free nonlinear programming
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Algorithms for solving common fixed point problems
- An analysis of the superiorization method via the principle of concentration of measure
- Computerized tomography with total variation and with shearlets
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- Convergence to approximate solutions and perturbation resilience of iterative algorithms
- Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
- Derivative-free and blackbox optimization
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Derivative-free superiorization with component-wise perturbations
- Fundamentals of Computerized Tomography
- Introduction to Derivative-Free Optimization
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative reconstruction techniques and their superiorization for the inversion of the Radon transform
- Nonlinear programming without a penalty function.
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Perturbation resilience and superiorization methodology of averaged mappings
- Preface: Superiorization: theory and applications
- Projection methods: an annotated bibliography of books and reviews
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Superiorization with level control
- Weak and strong superiorization: between feasibility-seeking and minimization
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
Cited in
(11)- Weak and strong superiorization: between feasibility-seeking and minimization
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Linear superiorization for infeasible linear programming
- Projected subgradient minimization versus superiorization
- Superiorized iteration algorithm for CT image simultaneous reconstruction and segmentation
- Superiorization for image analysis
- Perturbation resilience and superiorization of iterative algorithms
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- Decomposition in derivative-free optimization
- Derivative-free superiorization with component-wise perturbations
This page was built for publication: Derivative-free superiorization: principle and algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048824)
