Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization

zbMath1349.90675arXiv1410.0130MaRDI QIDQ2806693

Yair Censor

Publication date: 18 May 2016

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

zbMATH Keywords

constrained minimizationconvex feasibility problemperturbation resiliencedynamic string-averagingstrict Fejér monotonicitysuperiorization methodologysuperiorized version of an algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (22)

Feasibility-based fixed point networks ⋮ 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 ⋮ On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions ⋮ MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications ⋮ Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Decomposition in derivative-free optimization ⋮ Derivative-free superiorization with component-wise perturbations ⋮ Strong convergence of viscosity forward-backward algorithm to the sum of two accretive operators in Banach space ⋮ Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ Nesterov perturbations and projection methods applied to IMRT ⋮ An MM Algorithm for Split Feasibility Problems ⋮ Derivative-free superiorization: principle and algorithm ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning

This page was built for publication: Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization