Derivative-free superiorization: principle and algorithm

DOI10.1007/S11075-020-01038-WzbMATH Open1494.65040arXiv1908.10100OpenAlexW3096822320MaRDI QIDQ2048824FDOQ2048824

Authors: Yair Censor, Edgar Garduño, Gabor T. Herman, Elias Salomão Helou 

Publication date: 24 August 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1908.10100

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

zbMATH Keywords

regularizationconstrained minimizationderivative-free methodsuperiorizationproximity functionbounded perturbationscomponent-wise perturbations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Fundamentals of Computerized Tomography
• Weak and strong superiorization: between feasibility-seeking and minimization
• Title not available (Why is that?)
• Derivative-free methods for nonlinear programming with general lower-level constraints
• Iterative methods for fixed point problems in Hilbert spaces
• A progressive barrier for derivative-free nonlinear programming
• Nonlinear programming without a penalty function.
• Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
• Introduction to Derivative-Free Optimization
• Title not available (Why is that?)
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Projection methods: an annotated bibliography of books and reviews
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
• Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
• Preface: Superiorization: theory and applications
• Derivative-free and blackbox optimization
• Convergence to approximate solutions and perturbation resilience of iterative algorithms
• Perturbation resilience and superiorization methodology of averaged mappings
• Superiorization with level control
• XCT image reconstruction by a modified superiorized iteration and theoretical analysis
• Algorithms for solving common fixed point problems
• Derivative-free superiorization with component-wise perturbations
• Computerized tomography with total variation and with shearlets
• Iterative reconstruction techniques and their superiorization for the inversion of the Radon transform
• An analysis of the superiorization method via the principle of concentration of measure
• On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions

Cited In (11)

• Perturbation resilience and superiorization of iterative algorithms
• The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
• Projected subgradient minimization versus superiorization
• Derivative-free superiorization with component-wise perturbations
• Decomposition in derivative-free optimization
• Superiorization for image analysis
• Weak and strong superiorization: between feasibility-seeking and minimization
• Linear superiorization for infeasible linear programming
• On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
• Superiorized iteration algorithm for CT image simultaneous reconstruction and segmentation
• Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction

Uses Software

• MultiMin

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)