Pages that link to "Item:Q2251567"
From MaRDI portal
The following pages link to Projected subgradient minimization versus superiorization (Q2251567):
Displaying 30 items.
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations (Q679708) (← links)
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm (Q824550) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Derivative-free superiorization with component-wise perturbations (Q1736407) (← 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)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions (Q2192588) (← 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)
- A new step size rule for the superiorization method and its application in computerized tomography (Q2672729) (← 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)
- Superiorization: theory and applications (Q5346619) (← links)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← 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)
- Superiorization with level control (Q5346628) (← 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)
- Perturbation resilience of proximal gradient algorithm for composite objectives (Q5743220) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
- Approximate solutions of common fixed point problems with infinitely many operators (Q6065193) (← links)
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation (Q6204557) (← links)
