Searcharxiv⌕ Search

arXiv subjects

Matthew K Tam

Publications and source records attributed to Matthew K Tam.

3 recordsLinked to original sources

A Fast Proximal-Gradient Algorithm for Decentralised Optimisation

We consider a connected multi-agent network where agents coordinate to minimise a finite sum of convex functions. Each function in the sum can be further expressed as the sum of a smooth and nonsmooth component and is known only to a single agent in the network. We propose a decentralised proximal-gradient-type algorithm for solving this problem, which we term Fast PG-EXTRA. In each iteration, agents evaluate the gradient of the smooth component of their local objective functions and the proximal operator of the nonsmooth component, followed by communicating the results with neighbouring agents in the network. Fast PG-EXTRA can be viewed as an accelerated variant of PG-EXTRA, in the sense that it enjoys non-ergodic $o(1/k^2)$ convergence rates in terms of the first-order optimality residual, successive iterates, and consensus error, compared to PG-EXTRA's ergodic $O(1/k)$ convergence rates. Our analysis of Fast PG-EXTRA is based on an accelerated variant of the Condat--Vũ algorithm for non-distributed convex minimisation, which has similarly improved convergence rates compared to the Condat--Vũ algorithm. We validate our convergence results for Fast PG-EXTRA and demonstrate its potential advantages compared to PG-EXTRA with numerical experiments for power state system estimation and $l_1$-regularised logistic regression.

math.OC↗

Linear convergence of relocated fixed-point iterations

We establish linear convergence of relocated fixed-point iterations as introduced by Atenas et al. (2026) DOI: 10.1137/25M1776810 assuming the algorithmic operator satisfies a linear error bound. In particular, this framework applies to the setting where the algorithmic operator is a contraction. As a key application of our framework, we obtain linear convergence of the relocated Douglas--Rachford algorithm for finding a zero in the sum of two monotone operators in a setting with Lipschitz continuity and strong monotonicity assumptions. We also apply the framework to deduce linear convergence of variable stepsize resolvent splitting algorithms for multioperator monotone inclusions.

math.OC↗

A decentralised forward-backward-type algorithm with network-independent heterogenous agent step sizes

Consider the problem of finding a zero of a finite sum of maximally monotone operators, where some operators are Lipschitz continuous and the rest are potentially set-valued. We propose a forward-backward-type algorithm for this problem suitable for decentralised implementation. In each iteration, agents evaluate a Lipschitz continuous operator and the resolvent of a potentially set-valued operator, and then communicate with neighbouring agents. Agents choose their step sizes independently using only local information, and the step size upper bound has no dependence on the communication graph. We demonstrate the potential advantages of the proposed algorithm with numerical results for min-max problems and aggregative games.

math.OC↗