Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
From MaRDI portal
Publication:2346394
Abstract: We consider the superiorization methodology, which can be thought of as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full fledged constrained minimization problem; rather, the task is to find a feasible point which is superior (with respect to the objective function value) to one returned by a feasibility-seeking only algorithm. Our main result reveals new information about the mathematical behavior of the superiorization methodology. We deal with a constrained minimization problem with a feasible region, which is the intersection of finitely many closed convex constraint sets, and use the dynamic string-averaging projection method, with variable strings and variable weights, as a feasibility-seeking algorithm. We show that any sequence, generated by the superiorized version of a dynamic string-averaging projection algorithm, not only converges to a feasible point but, additionally, either its limit point solves the constrained minimization problem or the sequence is strictly Fej'er monotone with respect to a subset of the solution set of the original problem.
Recommendations
- An approach for the convex feasibility problem via monotropic programming
- scientific article; zbMATH DE number 1552272
- scientific article; zbMATH DE number 2227334
- Iterative solution of convex problems by fejer-monotone methods
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
- scientific article; zbMATH DE number 7213713
- A generalized projection feasible method with superlinear convergence for nonlinear optimization
- Extended projection methods for monotone variational inequalities
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
Cites work
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Alternating projection methods.
- Applied iterative methods.
- Averaging strings of sequential iterations for convex feasibility problems.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- 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
- scientific article; zbMATH DE number 5777888 (Why is no real title available?)
- scientific article; zbMATH DE number 2064237 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 1894728 (Why is no real title available?)
- scientific article; zbMATH DE number 2111135 (Why is no real title available?)
- scientific article; zbMATH DE number 908535 (Why is no real title available?)
- Image reconstruction from a small number of projections
- Iterative methods for fixed point problems in Hilbert spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- On the string averaging method for sparse common fixed-point problems
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Projected subgradient minimization versus superiorization
- Projection and proximal point methods: Convergence results and counterexamples.
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- String-averaging projected subgradient methods for constrained minimization
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT)
Cited in
(42)- Bounded perturbation resilience of extragradient-type methods and their applications
- Derivative-free superiorization with component-wise perturbations
- Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery
- 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
- Derivative-free superiorization: principle and algorithm
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Decomposition in derivative-free optimization
- Projected subgradient minimization versus superiorization
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Weak and strong superiorization: between feasibility-seeking and minimization
- Linear superiorization for infeasible linear programming
- Bounded perturbation resilience of the viscosity algorithm
- Nesterov perturbations and projection methods applied to IMRT
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings
- 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
- Superiorization with level control
- String-averaging algorithms for convex feasibility with infinitely many sets
- Multi-channel Potts-based reconstruction for multi-spectral computed tomography
- scientific article; zbMATH DE number 7753396 (Why is no real title available?)
- Superiorization technique with a projected subgradient method for games
- Perturbation Resilience of Self-Adaptive Step-Size Algorithms for Solving Split Variational Inclusion Problems and their Applications
- CONVERGENCE OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- Plug-and-play superiorization
- General perturbation resilient dynamic string-averaging for inconsistent problems with superiorization
- Solving common fixed point problems with a countable family of operators
- A new step size selection strategy for the superiorization methodology using subgradient vectors and its application for solving convex constrained optimization problems
- Convergence of algorithms based on unions of quasi-nonexpansive maps
- Convergence of inexact orbits of nonexpansive mappings in complete metric spaces
- A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of Dynamic String-Averaging in the inconsistent case
- A necessary condition for the guarantee of the superiorization method
- A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of dynamic string-averaging in the inconsistent case
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
This page was built for publication: Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346394)
