A note on the (accelerated) proximal gradient method for composite convex optimization
From MaRDI portal
Recommendations
- A note on the accelerated proximal gradient method for nonconvex optimization
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order o(1/k^2)
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- A modified proximal gradient method and its convergence rate
- Convergence rates of proximal gradient methods via the convex conjugate
Cited in
(22)- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Inexact proximal stochastic gradient method for convex composite optimization
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order o(1/k^2)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Accelerated proximal envelopes: application to componentwise methods
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- On some steplength approaches for proximal algorithms
- A modified proximal gradient method and its convergence rate
- Convergence rates of proximal gradient methods via the convex conjugate
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
- Accelerated dual-averaging primal–dual method for composite convex minimization
- A note on the accelerated proximal gradient method for nonconvex optimization
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient
- An acceleration of proximal diagonal Newton method
This page was built for publication: A note on the (accelerated) proximal gradient method for composite convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057944)
