Perturbation resilience and superiorization of iterative algorithms
From MaRDI portal
(Redirected from Publication:3570116)
Abstract: Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little demand on computer resources. For other problems, such as finding that point in the intersection at which the value of a given function is optimal, algorithms tend to need more computer memory and longer execution time. A methodology is presented whose aim is to produce automatically for an iterative algorithm of the first kind a "superiorized version" of it that retains its computational efficiency but nevertheless goes a long way towards solving an optimization problem. This is possible to do if the original algorithm is "perturbation resilient," which is shown to be the case for various projection algorithms for solving the consistent convex feasibility problem. The superiorized versions of such algorithms use perturbations that drive the process in the direction of the optimizer of the given function. After presenting these intuitive ideas in a precise mathematical form, they are illustrated in image reconstruction from projections for two different projection algorithms superiorized for the function whose value is the total variation of the image.
Recommendations
- Superiorization for image analysis
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- Iterative reconstruction techniques and their superiorization for the inversion of the Radon transform
- Derivative-free superiorization: principle and algorithm
Cited in
(90)- Bounded perturbation resilience of extragradient-type methods and their applications
- Derivative-free superiorization with component-wise perturbations
- Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- 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
- New inertial proximal gradient methods for unconstrained convex optimization problems
- 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
- Feasibility-based fixed point networks
- A simple look at the method for solving split feasibility problems in Hilbert spaces
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Projected subgradient minimization versus superiorization
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
- A new step size rule for the superiorization method and its application in computerized tomography
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- scientific article; zbMATH DE number 4133400 (Why is no real title available?)
- Bounded perturbation resilience of the viscosity algorithm
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Outer perturbations of a projection method and two approximation methods for the split equality problem
- Total variation superiorized conjugate gradient method for image reconstruction
- A relaxed projection method for split variational inequalities
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Nesterov perturbations and projection methods applied to IMRT
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings
- Asymptotic Behavior of Iterates of a Generic Cyclical Nonexpansive Mapping
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- Approximation of solutions of split inverse problem for multi-valued demi-contractive mappings in Hilbert spaces
- Superiorization for image analysis
- Preface: Superiorization: theory and applications
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- Asymptotic behavior of two algorithms for solving common fixed point problems
- Convergence to approximate solutions and perturbation resilience of iterative algorithms
- Can linear superiorization be useful for linear optimization problems?
- Perturbation resilience and superiorization methodology of averaged mappings
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Superiorization with level control
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- Computerized tomography with total variation and with shearlets
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
- Superiorization-based multi-energy CT image reconstruction
- String-averaging algorithms for convex feasibility with infinitely many sets
- Perturbation resilience of proximal gradient algorithm for composite objectives
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
- Bounded perturbation resilience of projected scaled gradient methods
- Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators
- Cyclical contractive mappings in hyperbolic spaces
- Approximate solutions of common fixed point problems with infinitely many operators
- Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- Perturbation Resilience of Self-Adaptive Step-Size Algorithms for Solving Split Variational Inclusion Problems and their Applications
- Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery
- Existence and convergence results for Perov contraction mappings
- CONVERGENCE OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation
- A fixed point theorem for nonself nonlinear contractions in length spaces
- Bounded perturbation resilience of a regularized forward-reflected-backward splitting method for solving variational inclusion problems with applications
- Algorithms for the split variational inequality problem
- Superiorized iteration algorithm for CT image simultaneous reconstruction and segmentation
- Asymptotic regularity results for a viscosity version of Halpern-type iterations for coincidence problems
- Approximate solutions for three fixed point problems
- The Krasnoselskii-Mann method for common coincidence problems
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- Plug-and-play superiorization
- Asymptotic regularity results for Halpern-type inexact iterations for coincidence problems
- Asymptotic regularity results for a viscosity version of Halpern-type iterations
- Algorithm analysis of solving fixed point of nonexpansive mappings based on Runge-Kutta method
- Solving common fixed point problems with a countable family of operators
- Noise propagation in linear stationary iterations
- Convergence of inexact orbits of nonexpansive mappings in complete metric spaces
- Existence of a fixed point for Boyd-Wong type contractions on metric spaces with graphs
- Convergence of the string-averaging algorithm for common fixed point problems with a countable family of operators
- A generalized projection-based scheme for solving convex constrained optimization problems
- Existence and approximation of coincidence points of set-valued mappings
- Fixed point theory for two classes of nonlinear mappings
- Biased superiorization of steepest descent: redefining the reconstruction target in noisy inverse problems
- On the boundedness of infinite products of relaxed projections: perturbations resilience and dynamic string-averaging
- A necessary condition for the guarantee of the superiorization method
- Optimization on solution sets of common fixed point problems with a countable family of maps
- Generic existence and approximation of points of coincidence for nonlinear mappings
- Generalized row-action methods for tomographic imaging
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
This page was built for publication: Perturbation resilience and superiorization of iterative algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3570116)
