Accelerated proximal envelopes: application to componentwise methods
From MaRDI portal
Publication:2116598
DOI10.1134/S0965542522020038zbMATH Open1487.90602OpenAlexW4220697903MaRDI QIDQ2116598FDOQ2116598
Recommendations
- On the computational efficiency of catalyst accelerated coordinate descent
- 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 composite convex optimization
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Gradient methods for minimizing composite functions
Cites Work
- Accelerated meta-algorithm for convex optimization problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Contracting proximal methods for smooth convex optimization
- Convex optimization: algorithms and complexity
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Efficient numerical methods for entropy-linear programming problems
- Lectures on convex optimization
- Monotone Operators and the Proximal Point Algorithm
Cited In (2)
Uses Software
This page was built for publication: Accelerated proximal envelopes: application to componentwise methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116598)
