An accelerated coordinate gradient descent algorithm for non-separable composite optimization
From MaRDI portal
Publication:2139254
Recommendations
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- A coordinate gradient descent method for nonsmooth nonseparable minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- Gradient methods for minimizing composite functions
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- Accelerated, parallel, and proximal coordinate descent
- An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in R^n
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Coordinate descent algorithms
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Envelope functions: unifications and further properties
- First-order methods in optimization
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Gradient methods for minimizing composite functions
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Iteration complexity analysis of block coordinate descent methods
- Modular proximal optimization for multidimensional total-variation regularization
- On the convergence of block coordinate descent type methods
- Pathwise coordinate optimization
- Proximité et dualité dans un espace hilbertien
- Smoothing and first order methods: a unified framework
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- The cyclic block conditional gradient method for convex optimization problems
- Total variation on a tree
Cited in
(9)- A generic coordinate descent solver for non-smooth convex optimisation
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- Interpolation conditions for linear operators and applications to performance estimation problems
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- Local linear convergence of proximal coordinate descent algorithm
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- Coordinate descent methods beyond smoothness and separability
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- A coordinate gradient descent method for nonsmooth nonseparable minimization
This page was built for publication: An accelerated coordinate gradient descent algorithm for non-separable composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139254)
