ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1309.5885
  4. Cited By
Smooth minimization of nonsmooth functions with parallel coordinate
  descent methods

Smooth minimization of nonsmooth functions with parallel coordinate descent methods

23 September 2013
Olivier Fercoq
Peter Richtárik
ArXivPDFHTML

Papers citing "Smooth minimization of nonsmooth functions with parallel coordinate descent methods"

15 / 15 papers shown
Title
Accelerated, Parallel and Proximal Coordinate Descent
Accelerated, Parallel and Proximal Coordinate Descent
Olivier Fercoq
Peter Richtárik
64
372
0
20 Dec 2013
Parallel coordinate descent for the Adaboost problem
Parallel coordinate descent for the Adaboost problem
Olivier Fercoq
ODL
57
11
0
07 Oct 2013
Separable Approximations and Decomposition Methods for the Augmented
  Lagrangian
Separable Approximations and Decomposition Methods for the Augmented Lagrangian
R. Tappenden
Peter Richtárik
Burak Büke
49
41
0
30 Aug 2013
On the Complexity Analysis of Randomized Block-Coordinate Descent
  Methods
On the Complexity Analysis of Randomized Block-Coordinate Descent Methods
Zhaosong Lu
Lin Xiao
67
254
0
21 May 2013
Accelerated Mini-Batch Stochastic Dual Coordinate Ascent
Accelerated Mini-Batch Stochastic Dual Coordinate Ascent
Shai Shalev-Shwartz
Tong Zhang
ODL
92
150
0
12 May 2013
Inexact Coordinate Descent: Complexity and Preconditioning
Inexact Coordinate Descent: Complexity and Preconditioning
R. Tappenden
Peter Richtárik
J. Gondzio
76
100
0
19 Apr 2013
Mini-Batch Primal and Dual Methods for SVMs
Mini-Batch Primal and Dual Methods for SVMs
Martin Takáč
A. Bijral
Peter Richtárik
Nathan Srebro
63
195
0
10 Mar 2013
Alternating Maximization: Unifying Framework for 8 Sparse PCA
  Formulations and Efficient Parallel Codes
Alternating Maximization: Unifying Framework for 8 Sparse PCA Formulations and Efficient Parallel Codes
Peter Richtárik
Majid Jahani
S. Ahipaşaoğlu
Martin Takáč
44
29
0
17 Dec 2012
Parallel Coordinate Descent Methods for Big Data Optimization
Parallel Coordinate Descent Methods for Big Data Optimization
Peter Richtárik
Martin Takáč
96
487
0
04 Dec 2012
Stochastic Dual Coordinate Ascent Methods for Regularized Loss
  Minimization
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Shai Shalev-Shwartz
Tong Zhang
133
1,031
0
10 Sep 2012
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
Simon Lacoste-Julien
Martin Jaggi
Mark Schmidt
Patrick A. Pletscher
122
365
0
19 Jul 2012
Iteration Complexity of Randomized Block-Coordinate Descent Methods for
  Minimizing a Composite Function
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function
Peter Richtárik
Martin Takáč
86
769
0
14 Jul 2011
The Rate of Convergence of AdaBoost
The Rate of Convergence of AdaBoost
Indraneel Mukherjee
Cynthia Rudin
Robert E. Schapire
90
64
0
29 Jun 2011
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Joseph K. Bradley
Aapo Kyrola
Danny Bickson
Carlos Guestrin
93
309
0
26 May 2011
A Primal-Dual Convergence Analysis of Boosting
A Primal-Dual Convergence Analysis of Boosting
Matus Telgarsky
55
34
0
25 Jan 2011
1