On the Convergence of FedProx with Extrapolation and Inexact Prox
Fuente:
arXiv
Saved in:
| Main Authors: | Li, Hanmin, Richtárik, Peter |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Power of Extrapolation in Federated Learning
by: Li, Hanmin, et al.
Published: (2024)
by: Li, Hanmin, et al.
Published: (2024)
Stabilized Proximal Point Method via Trust Region Control
by: Li, Hanmin, et al.
Published: (2026)
by: Li, Hanmin, et al.
Published: (2026)
Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)
by: Dvurechensky, Pavel, et al.
Published: (2024)
Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)
by: de Brito, Jose, et al.
Published: (2026)
Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
by: Li, Hanmin, et al.
Published: (2023)
by: Li, Hanmin, et al.
Published: (2023)
Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization
by: Li, Hanmin, et al.
Published: (2023)
by: Li, Hanmin, et al.
Published: (2023)
Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)
by: Zhang, Liwei, et al.
Published: (2025)
Tighter Performance Theory of FedExProx
by: Anyszka, Wojciech, et al.
Published: (2024)
by: Anyszka, Wojciech, et al.
Published: (2024)
Augmenting the FedProx Algorithm by Minimizing Convergence
by: Sarkar, Anomitra, et al.
Published: (2024)
by: Sarkar, Anomitra, et al.
Published: (2024)
An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
by: Liang, Ling, et al.
Published: (2024)
by: Liang, Ling, et al.
Published: (2024)
Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
by: Shen, Ya, et al.
Published: (2025)
by: Shen, Ya, et al.
Published: (2025)
A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)
by: Yang, Lei, et al.
Published: (2023)
On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)
by: Luner, Alan, et al.
Published: (2024)
On Convergence and Stability of Two Extended BB-like Step Sizes
by: Xu, Xin
Published: (2025)
by: Xu, Xin
Published: (2025)
Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)
by: Zhu, Zhihan, et al.
Published: (2024)
Stochastic interior-point methods for smooth conic optimization with applications
by: He, Chuan, et al.
Published: (2024)
by: He, Chuan, et al.
Published: (2024)
A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
by: Nguyen-Trung, Nghia, et al.
Published: (2025)
by: Nguyen-Trung, Nghia, et al.
Published: (2025)
Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
by: Burns, Matthew X., et al.
Published: (2025)
by: Burns, Matthew X., et al.
Published: (2025)
Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming
by: Nesterov, Yurii
Published: (2024)
by: Nesterov, Yurii
Published: (2024)
On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)
by: Xu, Xin
Published: (2025)
Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)
Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)
by: van Treek, Kira, et al.
Published: (2025)
Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
by: Chen, Jiaxin, et al.
Published: (2024)
by: Chen, Jiaxin, et al.
Published: (2024)
Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)
by: Chen, Kaihuang, et al.
Published: (2025)
ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization
by: Baraldi, Robert J., et al.
Published: (2025)
by: Baraldi, Robert J., et al.
Published: (2025)
A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)
by: Nishioka, Akatsuki, et al.
Published: (2023)
Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)
by: Tran-Dinh, Quoc, et al.
Published: (2024)
Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)
by: Tran-Dinh, Quoc, et al.
Published: (2025)
Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
by: Kitaoka, Akira
Published: (2024)
by: Kitaoka, Akira
Published: (2024)
Fast convergence of Frank-Wolfe algorithms on polytopes
by: Wirth, Elias, et al.
Published: (2024)
by: Wirth, Elias, et al.
Published: (2024)
Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)
by: Xia, Yong, et al.
Published: (2024)
Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
by: Kharitenko, Andrey, et al.
Published: (2025)
by: Kharitenko, Andrey, et al.
Published: (2025)
A high-order augmented Lagrangian method with arbitrarily fast convergence
by: Lee, Young-Ju, et al.
Published: (2026)
by: Lee, Young-Ju, et al.
Published: (2026)
An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
by: Xu, Xin
Published: (2025)
by: Xu, Xin
Published: (2025)
A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)
by: Yang, Yaguang
Published: (2022)
New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)
by: Dahl, Joachim, et al.
Published: (2025)
Convexoid: A Minimal Theory of Conjugate Convexity
by: Wei, Ningji
Published: (2024)
by: Wei, Ningji
Published: (2024)
An algorithm for minimum cardinality generators of cones
by: Mayer, Matthias Georg, et al.
Published: (2024)
by: Mayer, Matthias Georg, et al.
Published: (2024)
Exponential Conic Relaxations for Signomial Geometric Programming
by: Filabadi, Milad Dehghani, et al.
Published: (2024)
by: Filabadi, Milad Dehghani, et al.
Published: (2024)
Convex quartic problems: homogenized gradient method and preconditioning
by: Dragomir, Radu-Alexandru, et al.
Published: (2023)
by: Dragomir, Radu-Alexandru, et al.
Published: (2023)
Similar Items
-
The Power of Extrapolation in Federated Learning
by: Li, Hanmin, et al.
Published: (2024) -
Stabilized Proximal Point Method via Trust Region Control
by: Li, Hanmin, et al.
Published: (2026) -
Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024) -
Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026) -
Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
by: Li, Hanmin, et al.
Published: (2023)