activity
20122021
most citedNetwork Flows that Solve Least Squares for Linear Equations

6 citations · 20 across the 7 of their papers we have counts for

collaborators
Showing eess.SYShow all

5 papers · 1 filter

eess.SY2018★ 6 cited

Network Flows that Solve Least Squares for Linear Equations

Yang Liu, Youcheng Lou, Brian D. O. Anderson +1

This paper presents a first-order {distributed continuous-time algorithm} for computing the least-squares solution to a linear equation over networks. Given the uniqueness of the s…

eess.SY2015★ 3 cited

Distributed Surrounding Design of Target Region with Complex Adjacency Matrices

Youcheng Lou, Yiguang Hong

This is a complete version of the 6-page IEEE TAC technical note [1]. In this paper, we consider the distributed surrounding of a convex target set by a group of agents with switch…

eess.SY2015★ 2 cited

Distributed Continuous-time Approximate Projection Protocols for Shortest Distance Optimization Problems

Youcheng Lou, Yiguang Hong, Shouyang Wang

In this paper, we investigate the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from som…

eess.SY2013

Nash Equilibrium Computation in Subnetwork Zero-Sum Games with Switching Communications

Youcheng Lou, Yiguang Hong, Lihua Xie +2

In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks sha…

eess.SY2012★ 4 cited

An Approximate Projected Consensus Algorithm for Computing Intersection of Convex Sets

Youcheng Lou, Guodong Shi, Karl Henrik Johansson +1

In this paper, we propose an approximate projected consensus algorithm for a network to cooperatively compute the intersection of convex sets. Instead of assuming the exact convex…