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