Perturbation resilience of proximal gradient algorithm for composite objectives
DOI10.22436/jnsa.010.10.36zbMath1412.47123OpenAlexW2766651109MaRDI QIDQ5743220
Yansha Guo, Wei Cui, Yan Ni Guo
Publication date: 9 May 2019
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.10.36
weak convergencelasso problemperturbation resiliencecomposite optimizationproximal gradient algorithm
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Perturbations of nonlinear operators (47H14)
Related Items (2)
Cites Work
- Gradient methods for minimizing composite functions
- Strong convergence of a proximal point algorithm with general errors
- Properties and iterative methods for the lasso and its variants
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Projected subgradient minimization versus superiorization
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy
- Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
- Perturbation resilience and superiorization of iterative algorithms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Bounded perturbation resilience of projected scaled gradient methods
This page was built for publication: Perturbation resilience of proximal gradient algorithm for composite objectives