FedExProx's performance is no better than GD for quadratic optimization.
problem Improving convergence of parallel proximal algorithms.
method Developed a novel analysis framework to establish tighter convergence rates.
result FedExProx can outperform GD in non-strongly convex quadratic problems.