Can linear superiorization be useful for linear optimization problems?
From MaRDI portal
Publication:5346625
DOI10.1088/1361-6420/33/4/044006zbMath1397.90261arXiv1612.06533OpenAlexW2594408261WikidataQ47563107 ScholiaQ47563107MaRDI QIDQ5346625
Publication date: 26 May 2017
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.06533
linear programmingsimplex algorithmbounded perturbation resiliencesuperiorizationfeasibility-seekingAgmon-Motzkin-Schoenberg algorithm
Related Items
A new step size rule for the superiorization method and its application in computerized tomography ⋮ 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 ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Derivative-free superiorization with component-wise perturbations ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ Nesterov perturbations and projection methods applied to IMRT ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Single-projection procedure for linear optimization
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- There is no variational characterization of the cycles in the method of periodic projections
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Projected subgradient minimization versus superiorization
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Fundamentals of Computerized Tomography
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Projection methods: an annotated bibliography of books and reviews
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Perturbation resilience and superiorization of iterative algorithms
- On Diagonally Relaxed Orthogonal Projection Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- String-averaging projected subgradient methods for constrained minimization
- The Relaxation Method for Linear Inequalities
