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. 1308.6774
  4. Cited By
Separable Approximations and Decomposition Methods for the Augmented
  Lagrangian

Separable Approximations and Decomposition Methods for the Augmented Lagrangian

30 August 2013
R. Tappenden
Peter Richtárik
Burak Büke
ArXiv (abs)PDFHTML

Papers citing "Separable Approximations and Decomposition Methods for the Augmented Lagrangian"

13 / 13 papers shown
Title
Towards a Better Theoretical Understanding of Independent Subnetwork
  Training
Towards a Better Theoretical Understanding of Independent Subnetwork Training
Egor Shulgin
Peter Richtárik
AI4CE
99
6
0
28 Jun 2023
Stochastic, Distributed and Federated Optimization for Machine Learning
Stochastic, Distributed and Federated Optimization for Machine Learning
Jakub Konecný
FedML
70
38
0
04 Jul 2017
A Decentralized Second-Order Method with Exact Linear Convergence Rate
  for Consensus Optimization
A Decentralized Second-Order Method with Exact Linear Convergence Rate for Consensus Optimization
Aryan Mokhtari
Wei Shi
Qing Ling
Alejandro Ribeiro
70
124
0
01 Feb 2016
Distributed Optimization with Arbitrary Local Solvers
Distributed Optimization with Arbitrary Local Solvers
Chenxin Ma
Jakub Konecný
Martin Jaggi
Virginia Smith
Michael I. Jordan
Peter Richtárik
Martin Takáč
128
197
0
13 Dec 2015
Stochastic Dual Coordinate Ascent with Adaptive Probabilities
Stochastic Dual Coordinate Ascent with Adaptive Probabilities
Dominik Csiba
Zheng Qu
Peter Richtárik
ODL
137
97
0
27 Feb 2015
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization
Zheng Qu
Peter Richtárik
Martin Takáč
Olivier Fercoq
ODL
126
99
0
08 Feb 2015
Coordinate Descent with Arbitrary Sampling II: Expected Separable
  Overapproximation
Coordinate Descent with Arbitrary Sampling II: Expected Separable Overapproximation
Zheng Qu
Peter Richtárik
192
83
0
27 Dec 2014
Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity
Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity
Zheng Qu
Peter Richtárik
81
130
0
27 Dec 2014
Randomized Dual Coordinate Ascent with Arbitrary Sampling
Randomized Dual Coordinate Ascent with Arbitrary Sampling
Zheng Qu
Peter Richtárik
Tong Zhang
155
58
0
21 Nov 2014
Matrix Completion under Interval Uncertainty
Matrix Completion under Interval Uncertainty
Jakub Mareˇcek
Peter Richtárik
Martin Takáč
166
19
0
11 Aug 2014
On Optimal Probabilities in Stochastic Coordinate Descent Methods
On Optimal Probabilities in Stochastic Coordinate Descent Methods
Peter Richtárik
Martin Takáč
114
130
0
13 Oct 2013
Distributed Coordinate Descent Method for Learning with Big Data
Distributed Coordinate Descent Method for Learning with Big Data
Peter Richtárik
Martin Takáč
201
255
0
08 Oct 2013
Smooth minimization of nonsmooth functions with parallel coordinate
  descent methods
Smooth minimization of nonsmooth functions with parallel coordinate descent methods
Olivier Fercoq
Peter Richtárik
67
33
0
23 Sep 2013
1