Convergence rates of accelerated proximal gradient algorithms under independent noise
From MaRDI portal
(Redirected from Publication:2420162)
Recommendations
- Convergence rates of proximal gradient methods via the convex conjugate
- On stochastic accelerated gradient with convergence rate
- Convergence of stochastic proximal gradient algorithm
- Global convergence rate of proximal incremental aggregated gradient methods
- On convergence rates of proximal alternating direction method of multipliers
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\)
- A note on the accelerated proximal gradient method for nonconvex optimization
- Accelerated gradient methods with absolute and relative noise in the gradient
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
Cites work
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 1416652 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- A proximal stochastic gradient method with progressive variance reduction
- Accelerated and inexact forward-backward algorithms
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Adaptive subgradient methods for online learning and stochastic optimization
- An EM algorithm for wavelet-based image restoration
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Compressed sensing
- Convergence of a proximal point method in the presence of computational errors in Hilbert spaces
- Coordinate descent algorithms
- Coupling the proximal point algorithm with approximation methods
- Exact matrix completion via convex optimization
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- First-order methods of smooth convex optimization with inexact oracle
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Inexact and accelerated proximal point algorithms
- Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
- Minimizing finite sums with the stochastic average gradient
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Numerical methods for nondifferentiable convex optimization
- Precondition techniques for accelerated linearized Bregman algorithms
- Sparse wavelet representations of spatially varying blurring operators
- Statistical inverse problems: discretization, model reduction and inverse crimes
Cited in
(4)- Catalyst acceleration for first-order convex optimization: from theory to practice
- On the interplay between acceleration and identification for the proximal gradient algorithm
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Accelerated gradient methods with absolute and relative noise in the gradient
This page was built for publication: Convergence rates of accelerated proximal gradient algorithms under independent noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420162)
