Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
From MaRDI portal
bounded perturbation resilienceconvex minimization problemover-relaxedproximal gradient algorithmstrong convergence
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Methods involving semicontinuity and convergence; relaxation (49J45) Discrete approximations in optimal control (49M25) Numerical solution to inverse problems in abstract spaces (65J22) Optimality conditions and duality in mathematical programming (90C46)
Cites work
- A generalized forward-backward splitting method for solving quasi inclusion problems in Banach spaces
- A proximal decomposition method for solving convex variational inverse problems
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Bounded perturbation resilience of projected scaled gradient methods
- Composite self-concordant minimization
- Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Error sensitivity for strongly convergent modifications of the proximal point algorithm
- Feasibility-seeking and superiorization algorithms applied to inverse treatment planning in radiation therapy
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- On perturbed proximal gradient algorithms
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- Optimization with sparsity-inducing penalties
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation resilience of proximal gradient algorithm for composite objectives
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Projected subgradient minimization versus superiorization
- Properties and iterative methods for the lasso and its variants
- Proximité et dualité dans un espace hilbertien
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces
- Viscosity approximation methods for nonexpansive mappings
This page was built for publication: Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986410)
