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. 2004.02635
  4. Cited By
Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms
v1v2v3v4 (latest)

Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms

3 April 2020
Adil Salim
Laurent Condat
Konstantin Mishchenko
Peter Richtárik
ArXiv (abs)PDFHTML

Papers citing "Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms"

3 / 3 papers shown
Title
Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach
Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach
Colin Dirren
Mattia Bianchi
Panagiotis D. Grontas
John Lygeros
Florian Dorfler
141
0
0
18 Oct 2024
BALPA: A Balanced Primal-Dual Algorithm for Nonsmooth Optimization with
  Application to Distributed Optimization
BALPA: A Balanced Primal-Dual Algorithm for Nonsmooth Optimization with Application to Distributed Optimization
Luyao Guo
Jinde Cao
Xinli Shi
Shaofu Yang
42
0
0
06 Dec 2022
DISA: A Dual Inexact Splitting Algorithm for Distributed Convex
  Composite Optimization
DISA: A Dual Inexact Splitting Algorithm for Distributed Convex Composite Optimization
Luyao Guo
Xinli Shi
Shaofu Yang
Jinde Cao
70
12
0
05 Sep 2022
1