Bounded perturbation resilience of projected scaled gradient methods
From MaRDI portal
Publication:5963677
DOI10.1007/S10589-015-9777-XzbMATH Open1339.90262arXiv1507.07302OpenAlexW942366323MaRDI QIDQ5963677FDOQ5963677
Ming Jiang, Wenma Jin, Yair Censor
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1507.07302
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
superiorizationproximity functionbounded perturbation resilienceconvex minimization problemsprojected scaled gradient
Cites Work
- Fundamentals of Computerized Tomography
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Introductory lectures on convex optimization. A basic course.
- Weak and strong superiorization: between feasibility-seeking and minimization
- Title not available (Why is that?)
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- Title not available (Why is that?)
- A scaled gradient projection method for constrained image deblurring
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Title not available (Why is that?)
- Convex programming in Hilbert space
- Error bounds in mathematical programming
- Convergence analysis of perturbed feasible descent methods
- Title not available (Why is that?)
- Iterative methods for fixed point problems in Hilbert spaces
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Quasi-Fejérian analysis of some optimization algorithms
- Two-Metric Projection Methods for Constrained Optimization
- Title not available (Why is that?)
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Perturbation resilience and superiorization of iterative algorithms
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Error stability properties of generalized gradient-type algorithms
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- On Diagonally Relaxed Orthogonal Projection Methods
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Projected Landweber method and preconditioning
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Convergence analysis for a multiplicatively relaxed EM algorithm
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- Projected subgradient minimization versus superiorization
- A uniform approach to gradient methods for linear operator equations
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
- Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy
- A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
- Superiorization for Image Analysis
- Convergence results for scaled gradient algorithms in positron emission tomography
Cited In (14)
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
- Inertial projection and contraction algorithms for variational inequalities
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- New inertial proximal gradient methods for unconstrained convex optimization problems
- Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization
- Bounded perturbation resilience of extragradient-type methods and their applications
- Bounded perturbation resilience of the viscosity algorithm
- Discretized mid-value CLVI-PDNN based redundancy resolution for single leg of quadruped robot
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Perturbation resilience of proximal gradient algorithm for composite objectives
- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
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)
