Luyao Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luyao Guo has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Jinde Cao
School of Mathematics, Southeast University, Nanjing 210096, People’s Republic of China
12 shared publications - Xinli Shi
Southeast University
12 shared publications - Yuan Zhou
School of Cyber Science and Engineering, Southeast University, Nanjing, China
3 shared publications - Guanghui Wen
School of Automation, Southeast University, Nanjing, China
2 shared publications - Shaofu Yang
School of Computer Science and Engineering, Southeast University, Nanjing, 211189, China
2 shared publications Zihao Wang
School of Cyber Science and Engineering, Southeast University, Nanjing, China
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7521-7528
Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
This paper proposes a Perturbed Proximal Gradient ADMM (PPG-ADMM) framework for general nonconvex composite optimization problems. The core of PPG-ADMM is a perturbation mechanism that enhances convergence stability and, more importantly, relaxes two restrictive assumptions common in existing ADMM-based methods: smoothness of the final objective block and range inclusion conditions on the constraint matrices. Convergence is established through a technically constructed Lyapunov function, which guarantees sufficient descent and has a well-defined lower bound. With appropriate parameters, PPG-ADMM converges to an $\epsilon$-approximate stationary point with a sublinear convergence rate of $\mathcal {O}(1/\sqrt{K})$. Furthermore, with a suitably decaying perturbation parameter, the algorithm can attain an $\epsilon$-stationary point, ensuring stronger optimality guarantees. The framework is extended to fully decentralized settings, and its effectiveness is validated on a distributed nonconvex composite optimization task.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7521-7528
Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
This paper proposes a Perturbed Proximal Gradient ADMM (PPG-ADMM) framework for general nonconvex composite optimization problems. The core of PPG-ADMM is a perturbation mechanism that enhances convergence stability and, more importantly, relaxes two restrictive assumptions common in existing ADMM-based methods: smoothness of the final objective block and range inclusion conditions on the constraint matrices. Convergence is established through a technically constructed Lyapunov function, which guarantees sufficient descent and has a well-defined lower bound. With appropriate parameters, PPG-ADMM converges to an $\epsilon$-approximate stationary point with a sublinear convergence rate of $\mathcal {O}(1/\sqrt{K})$. Furthermore, with a suitably decaying perturbation parameter, the algorithm can attain an $\epsilon$-stationary point, ensuring stronger optimality guarantees. The framework is extended to fully decentralized settings, and its effectiveness is validated on a distributed nonconvex composite optimization task.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. PP, 1-14
A Proximal Gradient Method With Probabilistic Multi-Gossip Communications for Decentralized Composite Optimization
Decentralized optimization methods with local updates have recently gained attention for their provable ability to communication acceleration. In these methods, nodes perform several iterations of local computations between the communication rounds. Nevertheless, this capability is effective only when the network is sufficiently well-connected and the loss function is smooth. In this paper, we propose a communication-efficient method $\textsc {MG-Skip}$ with probabilistic local updates and multi-gossip communications for decentralized composite (smooth + nonsmooth) optimization, whose stepsize is independent of the number of local updates and the network topology. For any undirected and connected networks, $\textsc {MG-Skip}$ allows for the multi-gossip communications to be skipped in most iterations in the strongly convex setting, while its computation complexity is $\mathcal{O}(\kappa \log \nicefrac{1}{\epsilon})$ and communication complexity is only $\mathcal{O}(\sqrt{\nicefrac{\kappa}{(1-\rho)}} \log \nicefrac{1}{\epsilon})$, where $\kappa$ is the condition number of the loss function, $\rho$ reflects the connectivity of the network topology, and $\epsilon$ is the target accuracy. The theoretical results indicate that $\textsc {MG-Skip}$ achieves provable communication acceleration, thereby validating the advantages of local updates in the nonsmooth setting.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. PP, 1-14
A Proximal Gradient Method With Probabilistic Multi-Gossip Communications for Decentralized Composite Optimization
Decentralized optimization methods with local updates have recently gained attention for their provable ability to communication acceleration. In these methods, nodes perform several iterations of local computations between the communication rounds. Nevertheless, this capability is effective only when the network is sufficiently well-connected and the loss function is smooth. In this paper, we propose a communication-efficient method $\textsc {MG-Skip}$ with probabilistic local updates and multi-gossip communications for decentralized composite (smooth + nonsmooth) optimization, whose stepsize is independent of the number of local updates and the network topology. For any undirected and connected networks, $\textsc {MG-Skip}$ allows for the multi-gossip communications to be skipped in most iterations in the strongly convex setting, while its computation complexity is $\mathcal{O}(\kappa \log \nicefrac{1}{\epsilon})$ and communication complexity is only $\mathcal{O}(\sqrt{\nicefrac{\kappa}{(1-\rho)}} \log \nicefrac{1}{\epsilon})$, where $\kappa$ is the condition number of the loss function, $\rho$ reflects the connectivity of the network topology, and $\epsilon$ is the target accuracy. The theoretical results indicate that $\textsc {MG-Skip}$ achieves provable communication acceleration, thereby validating the advantages of local updates in the nonsmooth setting.
- 19 December 2024
- Published by Elsevier in Neural Networks
- Vol. 184, 107032
Accelerated quadratic penalty dynamic approaches with applications to distributed optimization
- 19 December 2024
- Published by Elsevier in Neural Networks
- Vol. 184, 107032
Accelerated quadratic penalty dynamic approaches with applications to distributed optimization
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 724-736
Differentially Private Decentralized Optimization With Relay Communication
Security concerns in large-scale networked environments are becoming increasingly critical. To further improve the algorithm security from the design perspective of decentralized optimization algorithms, we introduce a new measure: Privacy Leakage Frequency (PLF), which reveals the relationship between communication and privacy leakage of algorithms, showing that lower PLF corresponds to lower privacy budgets. Based on such assertion, a novel differentially private decentralized primal–dual algorithm named DP-RECAL is proposed to take advantage of operator splitting method and relay communication mechanism to experience less PLF so as to reduce the overall privacy budget. To the best of our knowledge, compared with existing differentially private algorithms, DP-RECAL presents superior privacy performance and communication complexity. In addition, with uncoordinated network-independent stepsizes, we prove the convergence of DP-RECAL for general convex problems and establish a linear convergence rate under the metric subregularity. Evaluation analysis on least squares problem and numerical experiments on real-world datasets verify our theoretical results and demonstrate that DP-RECAL can defend some classical gradient leakage attacks.
- 11 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 724-736
Differentially Private Decentralized Optimization With Relay Communication
Security concerns in large-scale networked environments are becoming increasingly critical. To further improve the algorithm security from the design perspective of decentralized optimization algorithms, we introduce a new measure: Privacy Leakage Frequency (PLF), which reveals the relationship between communication and privacy leakage of algorithms, showing that lower PLF corresponds to lower privacy budgets. Based on such assertion, a novel differentially private decentralized primal–dual algorithm named DP-RECAL is proposed to take advantage of operator splitting method and relay communication mechanism to experience less PLF so as to reduce the overall privacy budget. To the best of our knowledge, compared with existing differentially private algorithms, DP-RECAL presents superior privacy performance and communication complexity. In addition, with uncoordinated network-independent stepsizes, we prove the convergence of DP-RECAL for general convex problems and establish a linear convergence rate under the metric subregularity. Evaluation analysis on least squares problem and numerical experiments on real-world datasets verify our theoretical results and demonstrate that DP-RECAL can defend some classical gradient leakage attacks.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 202-215
A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization
In this paper, we address a composite optimization problem in a distributed network. Each agent in the network possesses a private local convex function consisting of a differentiable term, a nonsmooth term, and a nonsmooth term combined with a linear operator. The objective is to minimize the sum of all local functions while achieving consensus among the local states through information exchange with neighboring agents. To tackle this problem, we propose a novel distributed proximal alternating direction multiplier method (DP-ADMM). By introducing the proximal operator of the nonsmooth term, linearizing the smooth term, and incorporating an additional proximal term, the ADMM subproblem can be solved more efficiently. One key advantage of the proposed algorithm is that it allows each agent to select parameters without being constrained by the network topology. In some instances, the algorithm can be transformed into some classical optimization algorithms. The algorithm is further extended to an asynchronous version by introducing randomized block coordinate. We further analyze the convergence of the proposed asynchronous algorithm and establish the sublinear convergence rate under synchronous conditions. Finally, several numerical experiments are conducted to verify the effectiveness of the proposed algorithm.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 202-215
A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization
In this paper, we address a composite optimization problem in a distributed network. Each agent in the network possesses a private local convex function consisting of a differentiable term, a nonsmooth term, and a nonsmooth term combined with a linear operator. The objective is to minimize the sum of all local functions while achieving consensus among the local states through information exchange with neighboring agents. To tackle this problem, we propose a novel distributed proximal alternating direction multiplier method (DP-ADMM). By introducing the proximal operator of the nonsmooth term, linearizing the smooth term, and incorporating an additional proximal term, the ADMM subproblem can be solved more efficiently. One key advantage of the proposed algorithm is that it allows each agent to select parameters without being constrained by the network topology. In some instances, the algorithm can be transformed into some classical optimization algorithms. The algorithm is further extended to an asynchronous version by introducing randomized block coordinate. We further analyze the convergence of the proposed asynchronous algorithm and establish the sublinear convergence rate under synchronous conditions. Finally, several numerical experiments are conducted to verify the effectiveness of the proposed algorithm.
- 3 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 10, 539-551
Distributed Proximal Alternating Direction Method of Multipliers for Constrained Composite Optimization Over Directed Networks
In this study, we investigate a constrained composition optimization problem in a directed communication network. Each agent is equipped with a local objective function composed of both smooth and nonsmooth terms, as well as linear equality constraints. The optimization objective is to minimize the sum of all local functions, subject to linear equality constraints, through local computations and information exchange with neighboring agents. Based on the alternating direction method of multipliers (ADMM), a novel distributed optimization algorithm is proposed to address the composite optimization problem. We leverage the composite structure of the objective function, by introducing a linear approximation for the smooth term and a proximal mapping for the nonsmooth term, which simplifies the process of solving the ADMM subproblem. Furthermore, in contrast to the existing algorithms that eliminate the imbalance resulting from directed graphs using a column-stochastic matrix, the proposed algorithm only employs a row-stochastic matrix, thereby avoiding the need for agents to know their outdegree. Moreover, the step sizes of agents are uncoordinated and can be independent of the network topology. Furthermore, we prove that the proposed algorithm achieves a sublinear convergence rate when the local objective functions are convex. Finally, the effectiveness of the proposed algorithm is verified through numerical simulations.
- 3 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 10, 539-551
Distributed Proximal Alternating Direction Method of Multipliers for Constrained Composite Optimization Over Directed Networks
In this study, we investigate a constrained composition optimization problem in a directed communication network. Each agent is equipped with a local objective function composed of both smooth and nonsmooth terms, as well as linear equality constraints. The optimization objective is to minimize the sum of all local functions, subject to linear equality constraints, through local computations and information exchange with neighboring agents. Based on the alternating direction method of multipliers (ADMM), a novel distributed optimization algorithm is proposed to address the composite optimization problem. We leverage the composite structure of the objective function, by introducing a linear approximation for the smooth term and a proximal mapping for the nonsmooth term, which simplifies the process of solving the ADMM subproblem. Furthermore, in contrast to the existing algorithms that eliminate the imbalance resulting from directed graphs using a column-stochastic matrix, the proposed algorithm only employs a row-stochastic matrix, thereby avoiding the need for agents to know their outdegree. Moreover, the step sizes of agents are uncoordinated and can be independent of the network topology. Furthermore, we prove that the proposed algorithm achieves a sublinear convergence rate when the local objective functions are convex. Finally, the effectiveness of the proposed algorithm is verified through numerical simulations.
- 21 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (5) , 2157-2170
A Proximal ADMM-Based Distributed Optimal Energy Management Approach for Smart Grid With Stochastic Wind Power
In this paper, we address a novel and comprehensive social welfare maximization (SWM) problem for the optimal energy management in a smart grid. The objective is to maximize the total social welfare of dispatchable devices in the smart grid while satisfying certain constraints. Each device in the smart grid is required to meet its local power constraints, and the system as a whole maintains supply-demand balance, taking into account transmission losses and stochastic output power. To facilitate distributed algorithm design, we initially transform the SWM problem into an equivalent dual problem, which is a distributed composite optimization problem. Subsequently, a novel fully distributed proximal alternating direction method of multipliers (PADMM) is proposed, where each agent can autonomously select non-coordinated step size parameters based solely on local information, independent of other agents and the network structure. Detailed convergence analysis is provided, and a worst-case $\mathcal{O}(1/k)$ convergence rate is established in the non-ergodic sense. Finally, several numerical experiments are conducted to confirm the effectiveness of the proposed algorithm.
- 21 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (5) , 2157-2170
A Proximal ADMM-Based Distributed Optimal Energy Management Approach for Smart Grid With Stochastic Wind Power
In this paper, we address a novel and comprehensive social welfare maximization (SWM) problem for the optimal energy management in a smart grid. The objective is to maximize the total social welfare of dispatchable devices in the smart grid while satisfying certain constraints. Each device in the smart grid is required to meet its local power constraints, and the system as a whole maintains supply-demand balance, taking into account transmission losses and stochastic output power. To facilitate distributed algorithm design, we initially transform the SWM problem into an equivalent dual problem, which is a distributed composite optimization problem. Subsequently, a novel fully distributed proximal alternating direction method of multipliers (PADMM) is proposed, where each agent can autonomously select non-coordinated step size parameters based solely on local information, independent of other agents and the network structure. Detailed convergence analysis is provided, and a worst-case $\mathcal{O}(1/k)$ convergence rate is established in the non-ergodic sense. Finally, several numerical experiments are conducted to confirm the effectiveness of the proposed algorithm.
- 10 November 2023
- Published by Elsevier in Neural Networks
- Vol. 169, 673-684
Neurodynamic approaches for multi-agent distributed optimization
- 10 November 2023
- Published by Elsevier in Neural Networks
- Vol. 169, 673-684
Neurodynamic approaches for multi-agent distributed optimization
- 12 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (3) , 1316-1320
A Second-Order Primal–Dual Dynamics for Set Constrained Distributed Optimization Problems
The dynamical system with a second-order+first-order structure has been proven to be effective for solving convex optimization problems with equality constraints. In this paper, this structure is extended to distributed optimization to deal with set-constrained convex optimization problems under strongly connected and weight-balanced directed topology, and a continuous optimization dynamics based on projection operator and primal-dual method is proposed. When proper values of the system parameters are selected, the dynamics converges quickly to the optimal solution of the problem. Finally, two numerical experiments are given to verify the effectiveness of the proposed model.
- 12 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (3) , 1316-1320
A Second-Order Primal–Dual Dynamics for Set Constrained Distributed Optimization Problems
The dynamical system with a second-order+first-order structure has been proven to be effective for solving convex optimization problems with equality constraints. In this paper, this structure is extended to distributed optimization to deal with set-constrained convex optimization problems under strongly connected and weight-balanced directed topology, and a continuous optimization dynamics based on projection operator and primal-dual method is proposed. When proper values of the system parameters are selected, the dynamics converges quickly to the optimal solution of the problem. Finally, two numerical experiments are given to verify the effectiveness of the proposed model.