Perturbation resilience of proximal gradient algorithm for composite objectives

DOI10.22436/JNSA.010.10.36MaRDI QIDQ5743220zbMATH OpenOpenAlexFDO

Authors Wei Cui, Yansha Guo, Yanni 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

zbMATH Keywords

weak convergencelasso problemperturbation resiliencecomposite optimizationproximal gradient algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Perturbations of nonlinear operators (47H14)

Recommendations

• Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
• Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
• Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
• The perturbed proximal point algorithm and some of its applications
• Error stability properties of generalized gradient-type algorithms

Cites work

• Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• An inexact and nonmonotone proximal method for smooth unconstrained minimization
• Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
• Bounded perturbation resilience of projected scaled gradient methods
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
• Convex analysis and monotone operator theory in Hilbert spaces
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Feasibility-seeking and superiorization algorithms applied to inverse treatment planning in radiation therapy
• Gradient methods for minimizing composite functions
• On inexact generalized proximal methods with a weakened error tolerance criterion
• On the gradient-projection method for solving the nonsymmetric linear complementarity problem
• Perturbation resilience and superiorization of iterative algorithms
• Projected subgradient minimization versus superiorization
• Properties and iterative methods for the lasso and its variants
• Proximité et dualité dans un espace hilbertien
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Strong convergence of a proximal point algorithm with general errors
• Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction

Cited in

(2)

• Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
• Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization

This page was built for publication: Perturbation resilience of proximal gradient algorithm for composite objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743220)