Coordinate descent methods beyond smoothness and separability

Cites Work

Smooth minimization of non-smooth functions
Introductory lectures on convex optimization. A basic course.
From error bounds to the complexity of first-order descent methods for convex functions
Envelope functions: unifications and further properties
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
Fastest rates for stochastic mirror descent methods
An accelerated coordinate gradient descent algorithm for non-separable composite optimization
Kurdyka-Łojasiewicz exponent via inf-projection
Restarting the accelerated coordinate descent method with a rough strong convexity estimate
Smooth minimization of nonsmooth functions with parallel coordinate descent methods
Forward-backward quasi-Newton methods for nonsmooth optimization problems
Further properties of the forward-backward envelope with applications to difference-of-convex programming
Random gradient-free minimization of convex functions
Linear convergence of first order methods for non-strongly convex optimization
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
Total Variation on a Tree
Accelerated, Parallel, and Proximal Coordinate Descent
Variational Analysis
Relatively Smooth Convex Optimization by First-Order Methods, and Applications
Modular proximal optimization for multidimensional total-variation regularization
Application of a Smoothing Technique to Decomposition in Convex Optimization
Block Bregman Majorization Minimization with Extrapolation
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
Random Coordinate Descent Methods for Nonseparable Composite Optimization
Unnamed Item

This page was built for publication: Coordinate descent methods beyond smoothness and separability