Projected subgradient minimization versus superiorization
From MaRDI portal
Publication:2251567
DOI10.1007/S10957-013-0408-3zbMath1298.90104arXiv1308.4191OpenAlexW2011347843MaRDI QIDQ2251567
Reinhard W. Schulte, Gabor T. Herman, Luba Tetruashvili, Yair Censor, Ran Davidi
Publication date: 14 July 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4191
computerized tomographyimage reconstructionconstrained minimizationproximity functionsuperiorizationprojected subgradient methodbounded convergencefeasibility-seekingstrong perturbation resilience
Related Items (31)
Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm ⋮ Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings ⋮ A new step size rule for the superiorization method and its application in computerized tomography ⋮ Superiorization: theory and applications ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ 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 ⋮ Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment ⋮ Superiorization-based multi-energy CT image reconstruction ⋮ Approximate solutions of common fixed point problems with infinitely many operators ⋮ On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions ⋮ CONVERGENCE OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation ⋮ Total variation superiorized conjugate gradient method for image reconstruction ⋮ Derivative-free superiorization with component-wise perturbations ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Perturbation resilience of proximal gradient algorithm for composite objectives ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ 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 ⋮ 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 ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Iterative methods for fixed point problems in Hilbert spaces
- Random algorithms for convex minimization problems
- Fejér processes with diminishing disturbances
- Introductory lectures on convex optimization. A basic course.
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
- Fundamentals of Computerized Tomography
- Fejer algorithms with an adaptive step
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Image reconstruction from a small number of projections
- Envelope stepsize control for iterative algorithms based on Fejer processes with attractants
- On the string averaging method for sparse common fixed‐point problems
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Perturbation resilience and superiorization of iterative algorithms
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Minimization of unsmooth functionals
- Convex analysis and monotone operator theory in Hilbert spaces
- The use of additional diminishing disturbances in Fejer models of iterative algorithms
This page was built for publication: Projected subgradient minimization versus superiorization
