Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
DOI10.1080/02331934.2020.1722124OpenAlexW3005238466MaRDI QIDQ4986410
Publication date: 27 April 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1722124
strong convergencebounded perturbation resilienceconvex minimization problemproximal gradient algorithmover-relaxed
Optimality conditions and duality in mathematical programming (90C46) 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)
Cites Work
- Unnamed Item
- A generalized forward-backward splitting method for solving quasi inclusion problems in Banach spaces
- Error sensitivity for strongly convergent modifications of the proximal point algorithm
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Properties and iterative methods for the lasso and its variants
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- Viscosity approximation methods for nonexpansive mappings
- Projected subgradient minimization versus superiorization
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Optimization with Sparsity-Inducing Penalties
- Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- A proximal decomposition method for solving convex variational inverse problems
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Perturbation resilience and superiorization of iterative algorithms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces
- On perturbed proximal gradient algorithms
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Composite Self-Concordant Minimization
- Proximité et dualité dans un espace hilbertien
- Perturbation resilience of proximal gradient algorithm for composite objectives
- Convex analysis and monotone operator theory in Hilbert spaces
- Bounded perturbation resilience of projected scaled gradient methods
This page was built for publication: Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
