activity
20152022
most citedGame Design and Analysis for Price based Demand Response: An Aggregate Game Approach

292 citations · 606 across the 37 of their papers we have counts for

collaborators
Showing math.OCShow all

21 papers · 1 filter

math.OC2022

Duality-Based Distributed Optimization With Communication Delays in Multi-Cluster Networks

Jianzheng Wang, Guoqiang Hu

In this work, we consider solving a distributed optimization problem (DOP) in a multi-agent network with multiple agent clusters. In each cluster, the agents manage separable cost…

math.OC2022★ 2 cited

Distributed Optimization with Coupling Constraints in Multi-Cluster Networks Based on Dual Proximal Gradient Method

Jianzheng Wang, Guoqiang Hu

In this work, we consider solving a distributed optimization problem in a multi-agent network with multiple clusters. In each cluster, the involved agents cooperatively optimize a…

math.OC2021★ 2 cited

Distributed Generalized Nash Equilibrium Seeking of N-Coalition Games with Full and Distributive Constraints

Chao Sun, Guoqiang Hu

In this work, we investigate the distributed generalized Nash equilibrium (GNE) seeking problems for -coalition games with inequality constraints. First, we study the scenario w…

math.OC2021

Distributed Optimization with Coupling Constraints Based on Dual Proximal Gradient Method in Multi-Agent Networks

Jianzheng Wang, Guoqiang Hu

In this paper, we aim to solve a distributed optimization problem with affine coupling constraints in a multi-agent network, where the cost function of the agents is composed of sm…

math.OC2021★ 1 cited

Attack-Resilient Distributed Convex Optimization of Linear Multi-Agent Systems Against Malicious Cyber-Attacks over Random Digraphs

Zhi Feng, Guoqiang Hu

This paper addresses a resilient exponential distributed convex optimization problem for a heterogeneous linear multi-agent system under Denial-of-Service (DoS) attacks over random…

math.OC2021★ 1 cited

A Gradient-Free Distributed Optimization Method for Convex Sum of Non-Convex Cost Functions

Yipeng Pang, Guoqiang Hu

This paper presents a special type of distributed optimization problems, where the summation of agents' local cost functions (i.e., global cost function) is convex, but each indivi…

math.OC2021

Composite Optimization with Coupling Constraints via Penalized Proximal Gradient Method in Partially Asynchronous Networks

Jianzheng Wang, Guoqiang Hu

In this paper, we consider a composite optimization problem with linear coupling constraints in a multi-agent network. In this problem, all the agents jointly optimize a global com…

math.OC2021★ 3 cited

Composite Optimization with Coupling Constraints via Dual Proximal Gradient Method with Applications to Asynchronous Networks

Jianzheng Wang, Guoqiang Hu

In this paper, we consider solving a composite optimization problem with coupling constraints in a multi-agent network based on proximal gradient method. In this problem, all the a…

math.OC2020

Distributed Nash Equilibrium Seeking in N-Cluster Games with Fully Uncoordinated Constant Step-Sizes

Yipeng Pang, Guoqiang Hu

Distributed optimization and Nash equilibrium (NE) seeking problems have drawn much attention in the control community recently. This paper studies a class of non-cooperative games…

math.OC2020★ 28 cited

Distributed Nash Equilibrium Seeking for Monotone Generalized Noncooperative Games by a Regularized Penalty Method

Chao Sun, Guoqiang Hu

In this work, we study the distributed Nash equilibrium seeking problem for monotone generalized noncooperative games with set constraints and shared affine inequality constraints.…

math.OC2020★ 4 cited

A Continuous-Time Nesterov Accelerated Gradient Method for Centralized and Distributed Online Convex Optimization

Chao Sun, Guoqiang Hu

This paper studies the online convex optimization problem by using an Online Continuous-Time Nesterov Accelerated Gradient method (OCT-NAG). We show that the continuous-time dynami…

math.OC2020★ 10 cited

Gradient-Free Nash Equilibrium Seeking in N-Cluster Games with Uncoordinated Constant Step-Sizes

Yipeng Pang, Guoqiang Hu

This work investigates a problem of simultaneous global cost minimization and Nash equilibrium seeking, which commonly exists in -cluster non-cooperative games. Specifically, th…

math.OC2020★ 10 cited

Nash Equilibrium Seeking in N-Coalition Games via a Gradient-Free Method

Yipeng Pang, Guoqiang Hu

This paper studies an -coalition non-cooperative game problem, where the players in the same coalition cooperatively minimize the sum of their local cost functions under a direc…

math.OC2020★ 1 cited

Gradient-Free Distributed Optimization with Exact Convergence

Yipeng Pang, Guoqiang Hu

In this paper, a gradient-free distributed algorithm is introduced to solve a set constrained optimization problem under a directed communication network. Specifically, at each tim…

math.OC2020★ 2 cited

Distributed Nash Equilibrium Seeking with Limited Cost Function Knowledge via A Consensus-Based Gradient-Free Method

Yipeng Pang, Guoqiang Hu

This paper considers a distributed Nash equilibrium seeking problem, where the players only have partial access to other players' actions, such as their neighbors' actions. Thus, t…

math.OC2020★ 2 cited

A Proximal Linearization-based Decentralized Method for Nonconvex Problems with Nonlinear Constraints

Yu Yang, Guoqiang Hu, Costas J. Spanos

Decentralized optimization for non-convex problems are now demanding by many emerging applications (e.g., smart grids, smart building, etc.). Though dramatic progress has been achi…

math.OC2019★ 5 cited

Adaptive Approaches for Fully Distributed Nash Equilibrium Seeking in Networked Games

Maojiao Ye, Guoqiang Hu

This paper considers the design of fully distributed Nash equilibrium seeking strategies for multi-agent games. To develop fully distributed seeking strategies, two adaptive contro…

math.OC2019

Differentially private Nash equilibrium seeking for networked aggregative games

Maojiao Ye, Guoqiang Hu, Lihua Xie +1

This paper considers the privacy-preserving Nash equilibrium seeking strategy design for a class of networked aggregative games, in which the players' objective functions are consi…

math.OC2019★ 3 cited

Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret Analysis

Yipeng Pang, Guoqiang Hu

This work considered an online distributed optimization problem, with a group of agents whose local objective functions vary with time. Moreover, the value of the objective functio…

math.OC2017★ 114 cited

A Unified Strategy for Solution Seeking in Graphical N-coalition Noncooperative Games

Maojiao Ye, Guoqiang Hu, Frank L. Lewis +1

This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the -coalition noncooperative games proposed in [1]. The objective…

math.OC2016★ 10 cited

Distributed Nash Equilibrium Seeking by A Consensus Based Approach

Maojiao Ye, Guoqiang Hu

In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the playe…