Smooth Minimization of Nonsmooth Functions with Parallel Coordinate Descent Methods
Authors:
- 15 February 2019
- book chapter
- Published by Springer Nature
- p. 57-96
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Accelerated, Parallel, and Proximal Coordinate DescentSIAM Journal on Optimization, 2015
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic OptimizationSIAM Journal on Optimization, 2015
- Parallel Coordinate Descent for the Adaboost Problem2013
- Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPCJournal of Process Control, 2013
- Parallel Boosting with MomentumLecture Notes in Computer Science, 2013
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization ProblemsSIAM Journal on Optimization, 2012
- Randomized Methods for Linear Constraints: Convergence Rates and ConditioningMathematics of Operations Research, 2010
- Identifying suspicious URLs2009
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Logistic Regression, AdaBoost and Bregman DistancesMachine Learning, 2002