Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
From MaRDI portal
Publication:824550
DOI10.1186/s13660-018-1695-xzbMath1497.49018OpenAlexW2803775597WikidataQ55048478 ScholiaQ55048478MaRDI QIDQ824550
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1695-x
strong convergencebounded perturbation resilienceconvex minimization problemviscosity approximationmodified proximal gradient algorithm
Methods involving semicontinuity and convergence; relaxation (49J45) Methods of reduced gradient type (90C52)
Related Items
Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method ⋮ Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery ⋮ A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space ⋮ New inertial proximal gradient methods for unconstrained convex optimization problems ⋮ Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization ⋮ A modified hybrid algorithm for solving a composite minimization problem in Banach spaces
Cites Work
- Unnamed Item
- Bounded perturbation resilience of the viscosity algorithm
- Averaged mappings and the gradient-projection algorithm
- Properties and iterative methods for the lasso and its variants
- Viscosity approximation methods for nonexpansive mappings
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Viscosity approximation methods for fixed-points problems
- Block SOR methods for the solution of indefinite least squares problems
- 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 Algorithms for Nonlinear Operators
- Perturbation resilience and superiorization of iterative algorithms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Perturbation resilience and superiorization methodology of averaged mappings
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Superiorization with level control
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Signal Recovery by Proximal Forward-Backward Splitting
- 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 and bounded perturbation resilience of a modified proximal gradient algorithm
