Bounded perturbation resilience of projected scaled gradient methods
From MaRDI portal
Publication:5963677
Abstract: We investigate projected scaled gradient (PSG) methods for convex minimization problems. These methods perform a descent step along a diagonally scaled gradient direction followed by a feasibility regaining step via orthogonal projection onto the constraint set. This constitutes a generalized algorithmic structure that encompasses as special cases the gradient projection method, the projected Newton method, the projected Landweber-type methods and the generalized Expectation-Maximization (EM)-type methods. We prove the convergence of the PSG methods in the presence of bounded perturbations. This resilience to bounded perturbations is relevant to the ability to apply the recently developed superiorization methodology to PSG methods, in particular to the EM algorithm.
Recommendations
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Bounded perturbation resilience of extragradient-type methods and their applications
- New convergence results for the scaled gradient projection method
- Projected subgradient minimization versus superiorization
- Perturbation resilience and superiorization methodology of averaged mappings
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1194487 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
- A scaled gradient projection method for constrained image deblurring
- A uniform approach to gradient methods for linear operator equations
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Applied iterative methods.
- Convergence analysis for a multiplicatively relaxed EM algorithm
- Convergence analysis of perturbed feasible descent methods
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Convergence results for scaled gradient algorithms in positron emission tomography
- Convex programming in Hilbert space
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error bounds in mathematical programming
- Error stability properties of generalized gradient-type algorithms
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Feasibility-seeking and superiorization algorithms applied to inverse treatment planning in radiation therapy
- Fundamentals of Computerized Tomography
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Introductory lectures on convex optimization. A basic course.
- Iterative methods for fixed point problems in Hilbert spaces
- On Diagonally Relaxed Orthogonal Projection Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Projected Landweber method and preconditioning
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projected subgradient minimization versus superiorization
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Quasi-Fejérian analysis of some optimization algorithms
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- Superiorization for image analysis
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
- Two-Metric Projection Methods for Constrained Optimization
- Weak and strong superiorization: between feasibility-seeking and minimization
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
Cited in
(15)- Perturbation resilience of proximal gradient algorithm for composite objectives
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- New inertial proximal gradient methods for unconstrained convex optimization problems
- Bounded perturbation resilience of the viscosity algorithm
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Discretized mid-value CLVI-PDNN based redundancy resolution for single leg of quadruped robot
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- PET-MRI joint reconstruction by joint sparsity based tight frame regularization
- Bounded perturbation resilience of extragradient-type methods and their applications
- Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- Inertial projection and contraction algorithms for variational inequalities
This page was built for publication: Bounded perturbation resilience of projected scaled gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963677)
