3 citations · 8 across the 5 of their papers we have counts for
12 papers · 1 filter
Linear convergence of distributed Dykstra's algorithm for sets under an intersection property
C. H. Jeffrey Pang
We show the linear convergence of Dykstra's algorithm for sets intersecting in a manner slightly stronger than the usual constraint qualifications.
Linear convergence of a dual optimization formulation for distributed optimization on directed graphs with unreliable communications
C. H. Jeffrey Pang
This work builds on our recent work on a distributed optimization algorithm for graphs with directed unreliable communications. We show its linear convergence when we take either t…
Convergence rate of distributed Dykstra's algorithm with sets defined as level sets of convex functions
C. H. Jeffrey Pang
We investigate the convergence rate of the distributed Dykstra's algorithm when some of the sets are defined as the level sets of convex functions. We carry out numerical experimen…
A dual ascent algorithm for asynchronous distributed optimization with unreliable directed communications
C. H. Jeffrey Pang
We show that the averaged consensus algorithm on directed graphs with unreliable communications by Bof-Carli-Schenato has a dual optimization interpretation, which could be extende…
Linear and sublinear convergence rates for a subdifferentiable distributed deterministic asynchronous Dykstra's algorithm
C. H. Jeffrey Pang
In two earlier papers, we designed a distributed deterministic asynchronous algorithm for minimizing the sum of subdifferentiable and proximable functions and a regularizing quadra…
Subdifferentiable functions and partial data communication in a distributed deterministic asynchronous Dykstra's algorithm
C. H. Jeffrey Pang
We described a decentralized distributed deterministic asynchronous Dykstra's algorithm that allows for time-varying graphs in an earlier paper. In this paper, we show how to incor…