Pages that link to "Item:Q3570116"
From MaRDI portal
The following pages link to Perturbation resilience and superiorization of iterative algorithms (Q3570116):
Displayed 50 items.
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Bounded perturbation resilience of the viscosity algorithm (Q343563) (← links)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- A relaxed projection method for split variational inequalities (Q493247) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations (Q511032) (← links)
- Algorithms for the split variational inequality problem (Q663488) (← links)
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations (Q679708) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Generalized row-action methods for tomographic imaging (Q742852) (← links)
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm (Q824550) (← links)
- Bounded perturbation resilience of extragradient-type methods and their applications (Q1677995) (← links)
- Derivative-free superiorization with component-wise perturbations (Q1736407) (← links)
- Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery (Q1742528) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy (Q2020314) (← links)
- An analysis of the superiorization method via the principle of concentration of measure (Q2041036) (← links)
- New inertial proximal gradient methods for unconstrained convex optimization problems (Q2069605) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
- Feasibility-based fixed point networks (Q2138454) (← links)
- A simple look at the method for solving split feasibility problems in Hilbert spaces (Q2175896) (← links)
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions (Q2192588) (← links)
- Projected subgradient minimization versus superiorization (Q2251567) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications (Q2423786) (← links)
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT) (Q2437932) (← links)
- A new step size rule for the superiorization method and its application in computerized tomography (Q2672729) (← links)
- Outer perturbations of a projection method and two approximation methods for the split equality problem (Q4559405) (← links)
- Total variation superiorized conjugate gradient method for image reconstruction (Q4634746) (← links)
- Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization (Q4986410) (← links)
- Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings (Q5067641) (← links)
- Asymptotic Behavior of Iterates of a Generic Cyclical Nonexpansive Mapping (Q5071317) (← links)
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method (Q5110322) (← links)
- (Q5126296) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization (Q5346622) (← links)
- Asymptotic behavior of two algorithms for solving common fixed point problems (Q5346623) (← links)
- Convergence to approximate solutions and perturbation resilience of iterative algorithms (Q5346624) (← links)
- Can linear superiorization be useful for linear optimization problems? (Q5346625) (← links)
- Perturbation resilience and superiorization methodology of averaged mappings (Q5346626) (← links)
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method (Q5346627) (← links)
- Computerized tomography with total variation and with shearlets (Q5346630) (← links)
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment (Q5346631) (← links)
- Superiorization-based multi-energy CT image reconstruction (Q5346634) (← links)
- String-averaging algorithms for convex feasibility with infinitely many sets (Q5382471) (← links)