Perturbation resilience and superiorization of iterative algorithms
From MaRDI portal
Publication:3570116
DOI10.1088/0266-5611/26/6/065008zbMath1193.65019arXiv1005.0069OpenAlexW2146418213WikidataQ33961996 ScholiaQ33961996MaRDI QIDQ3570116
Ran Davidi, Gabor T. Herman, Yair Censor
Publication date: 24 June 2010
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.0069
iterative algorithmsconvex setscomputational efficiencyimage reconstructionintersectiongraphical examplesprojection algorithms
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Feasibility-based fixed point networks, Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings, Asymptotic Behavior of Iterates of a Generic Cyclical Nonexpansive Mapping, Outer perturbations of a projection method and two approximation methods for the split equality problem, Bounded perturbation resilience of the viscosity algorithm, Subgradient projection algorithms and approximate solutions of convex feasibility problems, A simple look at the method for solving split feasibility problems in Hilbert spaces, Bounded perturbation resilience of extragradient-type methods and their applications, A new step size rule for the superiorization method and its application in computerized tomography, 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, 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, Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators, 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, On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions, MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications, Convergence and perturbation resilience of dynamic string-averaging projection methods, Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method, 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, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT), Unnamed Item, String-averaging algorithms for convex feasibility with infinitely many sets, Algorithms for the split variational inequality problem, Total variation superiorized conjugate gradient method for image reconstruction, Derivative-free superiorization with component-wise perturbations, A relaxed projection method for split variational inequalities, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, 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, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, Projected subgradient minimization versus superiorization, Perturbation resilience of proximal gradient algorithm for composite objectives, 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, Generalized row-action methods for tomographic imaging, Unnamed Item, New inertial proximal gradient methods for unconstrained convex optimization problems, Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, A generalized block-iterative projection method for the common fixed point problem induced by cutters, XCT image reconstruction by a modified superiorized iteration and theoretical analysis, The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
