A generic coordinate descent solver for nonsmooth convex optimization
arXiv:1812.00628
Abstract
We present a generic coordinate descent solver for the minimization of a nonsmooth convex objective with structure. The method can deal in particular with problems with linear constraints. The implementation makes use of efficient residual updates and automatically determines which dual variables should be duplicated. A list of basic functional atoms is pre-compiled for efficiency and a modelling language in Python allows the user to combine them at run time. So, the algorithm can be used to solve a large variety of problems including Lasso, sparse multinomial logistic regression, linear and quadratic programs.
References in corpus (14)
- Pathwise coordinate optimization
- Parallel Coordinate Descent for L1-Regularized Loss Minimization
- Distributed Coordinate Descent Method for Learning with Big Data
- Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
- Proximal Stochastic Dual Coordinate Ascent
- A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- A Coordinate Descent Primal-Dual Algorithm with Large Step Size and Possibly Non Separable Functions
- A Primer on Coordinate Descent Algorithms
- Smooth minimization of nonsmooth functions with parallel coordinate descent methods
- Asynchronous Coordinate Descent under More Realistic Assumptions
- On Optimal Probabilities in Stochastic Coordinate Descent Methods
- Randomized Primal-Dual Proximal Block Coordinate Updates
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming
- On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent