Coordinate descent methods beyond smoothness and separability
From MaRDI portal
Recommendations
- A coordinate gradient descent method for nonsmooth nonseparable minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- Smooth minimization of nonsmooth functions with parallel coordinate descent methods
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- On the complexity analysis of randomized block-coordinate descent methods
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Accelerated, parallel, and proximal coordinate descent
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Block Bregman majorization minimization with extrapolation
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Envelope functions: unifications and further properties
- Fastest rates for stochastic mirror descent methods
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- From error bounds to the complexity of first-order descent methods for convex functions
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- scientific article; zbMATH DE number 2171466 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Kurdyka-Łojasiewicz exponent via inf-projection
- Linear convergence of first order methods for non-strongly convex optimization
- Modular proximal optimization for multidimensional total-variation regularization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Random gradient-free minimization of convex functions
- Relatively smooth convex optimization by first-order methods, and applications
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Smooth minimization of non-smooth functions
- Smooth minimization of nonsmooth functions with parallel coordinate descent methods
- Total variation on a tree
- Variational Analysis
This page was built for publication: Coordinate descent methods beyond smoothness and separability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498410)
