Weak and strong superiorization: between feasibility-seeking and minimization
zbMATH Open1349.90675arXiv1410.0130MaRDI QIDQ2806693FDOQ2806693
Authors: Yair Censor
Publication date: 18 May 2016
Published in: Analele Științifice ale Universității ``Ovidius Constanța. Seria: Matematică (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.0130
Recommendations
constrained minimizationconvex feasibility problemperturbation resiliencedynamic string-averagingsuperiorization methodologysuperiorized version of an algorithmstrict Fejér monotonicity
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30)
Cited In (28)
- String-averaging algorithms for convex feasibility with infinitely many sets
- A generalized projection-based scheme for solving convex constrained optimization problems
- 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
- Nesterov perturbations and projection methods applied to IMRT
- Feasibility-seeking and superiorization algorithms applied to inverse treatment planning in radiation therapy
- Derivative-free superiorization: principle and algorithm
- Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery
- Decomposition in derivative-free optimization
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Title not available (Why is that?)
- Feasibility-based fixed point networks
- Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- An analysis of the superiorization method via the principle of concentration of measure
- Preface: Superiorization: theory and applications
- Linear superiorization for infeasible linear programming
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation
- A new step size rule for the superiorization method and its application in computerized tomography
- 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
- An MM Algorithm for Split Feasibility Problems
- Superiorization with level control
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Strong convergence of viscosity forward-backward algorithm to the sum of two accretive operators in Banach space
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
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)