Weak and strong superiorization: between feasibility-seeking and minimization
From MaRDI portal
Publication:2806693
Abstract: We review the superiorization methodology, which can be thought of, in some cases, as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full fledged constrained minimization problem; rather, the task is to find a feasible point which is superior (with respect to an objective function value) to one returned by a feasibility-seeking only algorithm. We distinguish between two research directions in the superiorization methodology that nourish from the same general principle: Weak superiorization and strong superiorization and clarify their nature.
Recommendations
Cited in
(28)- Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery
- Strong convergence of viscosity forward-backward algorithm to the sum of two accretive operators in Banach space
- An MM Algorithm for Split Feasibility Problems
- Feasibility-based fixed point networks
- scientific article; zbMATH DE number 7753396 (Why is no real title available?)
- An analysis of the superiorization method via the principle of concentration of measure
- String-averaging algorithms for convex feasibility with infinitely many sets
- Derivative-free superiorization: principle and algorithm
- Superiorization with level control
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Preface: Superiorization: theory and applications
- Linear superiorization for infeasible linear programming
- Nesterov perturbations and projection methods applied to IMRT
- Projected subgradient minimization versus superiorization
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- A generalized projection-based scheme for solving convex constrained optimization problems
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Bounded perturbation resilience of projected scaled gradient methods
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- 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
- A new step size rule for the superiorization method and its application in computerized tomography
- Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- Feasibility-seeking and superiorization algorithms applied to inverse treatment planning in radiation therapy
This page was built for publication: Weak and strong superiorization: between feasibility-seeking and minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806693)
