An analysis of the superiorization method via the principle of concentration of measure
From MaRDI portal
Publication:2041036
DOI10.1007/s00245-019-09628-4OpenAlexW2985493145MaRDI QIDQ2041036
Publication date: 15 July 2021
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00398
random matrixconcentration of measuresuperiorizationHilbert-Schmidt normperturbation resiliencefeasibility-seeking algorithmlinear superiorizationsuperiorization matrixtarget function reduction
Related Items
Derivative-free superiorization: principle and algorithm ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differentiability properties of metric projections onto convex sets
- A tricentenary history of the law of large numbers
- Iterative methods for fixed point problems in Hilbert spaces
- A new look at independence
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convexity and concentration
- Projected subgradient minimization versus superiorization
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Concentration of measure principle and entropy-inequalities
- Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
- Linear Superiorization for Infeasible Linear Programming
- Random matrix theory
- 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
- $L_p$-norm uniform distribution
- Introduction to Riemannian Manifolds
- On Projection Algorithms for Solving Convex Feasibility Problems
- Superiorization for Image Analysis
- Superiorization: theory and applications
- Can linear superiorization be useful for linear optimization problems?
- Convex analysis and monotone operator theory in Hilbert spaces
- Concentration of Measure for the Analysis of Randomized Algorithms
