Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods

DOI10.1007/s10957-014-0591-xzbMath1322.90063arXiv1405.7121OpenAlexW2135528585MaRDI QIDQ2346394

Yair Censor, Zaslavski, Alexander J.

Publication date: 1 June 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.7121

zbMATH Keywords

constrained minimizationconvex feasibility problemsubgradientsbounded perturbation resiliencedynamic string-averaging projectionsstrict Fejér monotonicitysuperiorization methodologysuperiorized version of an algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items

Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm ⋮ Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings ⋮ Bounded perturbation resilience of the viscosity algorithm ⋮ Bounded perturbation resilience of extragradient-type methods and their applications ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ 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 ⋮ 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 OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Decomposition in derivative-free optimization ⋮ Derivative-free superiorization with component-wise perturbations ⋮ 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 ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ Nesterov perturbations and projection methods applied to IMRT ⋮ Derivative-free superiorization: principle and algorithm ⋮ Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization ⋮ Multi-channel Potts-based reconstruction for multi-spectral computed tomography ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Projection and proximal point methods: Convergence results and counterexamples.
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• 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
• Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
• Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy
• Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
• Image reconstruction from a small number of projections
• On the string averaging method for sparse common fixed‐point problems
• Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
• Perturbation resilience and superiorization of iterative algorithms
• 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
• Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
• String-averaging projected subgradient methods for constrained minimization
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods