activity
20222026
most citedDecentralized Inexact Proximal Gradient Method With Network-Independent Stepsizes for Convex Composite Optimization

22 citations · 26 across the 7 of their papers we have counts for

collaborators

8 papers

math.OC2026

Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration

Luyao Guo, Xinli Shi, Wenying Xu +1

This paper is concerned with the distributed composite optimization problem over networks, where agents aim to minimize a sum of local smooth components and a common nonsmooth term…

math.OC2025

Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization

Yuan Zhou, Xinli Shi, Luyao Guo +2

This paper proposes a Perturbed Proximal Gradient ADMM (PPG-ADMM) framework for solving general nonconvex composite optimization problems, where the objective function consists of…

math.OC2023

A Proximal Gradient Method With Probabilistic Multi-Gossip Communications for Decentralized Composite Optimization

Luyao Guo, Luqing Wang, Xinli Shi +1

Decentralized optimization methods with local updates have recently gained attention for their provable ability to communication acceleration. In these methods, nodes perform sever…

cs.LG2023★ 1 cited

Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization

Luyao Guo, Sulaiman A. Alghunaim, Kun Yuan +2

The ProxSkip algorithm for distributed optimization is gaining increasing attention due to its effectiveness in reducing communication. However, existing analyses of ProxSkip are l…

math.OC2023★ 22 cited

Decentralized Inexact Proximal Gradient Method With Network-Independent Stepsizes for Convex Composite Optimization

Luyao Guo, Xinli Shi, Jinde Cao +1

This paper proposes a novel CTA (Combine-Then-Adapt)-based decentralized algorithm for solving convex composite optimization problems over undirected and connected networks. The lo…

math.OC2022

BALPA: A Balanced Primal-Dual Algorithm for Nonsmooth Optimization with Application to Distributed Optimization

Luyao Guo, Jinde Cao, Xinli Shi +1

In this paper, we propose a novel primal-dual proximal splitting algorithm (PD-PSA), named BALPA, for the composite optimization problem with equality constraints, where the loss f…

math.OC2022★ 3 cited

Differentially Private Decentralized Optimization with Relay Communication

Luqing Wang, Luyao Guo, Shaofu Yang +1

Security concerns in large-scale networked environments are becoming increasingly critical. To further improve the algorithm security from the design perspective of decentralized o…

math.OC2022

DISA: A Dual Inexact Splitting Algorithm for Distributed Convex Composite Optimization

Luyao Guo, Xinli Shi, Shaofu Yang +1

In this paper, we propose a novel Dual Inexact Splitting Algorithm (DISA) for distributed convex composite optimization problems, where the local loss function consists of a smooth…