On coordinated primal-dual interior-point methods for multi-agent optimization
On coordinated primal-dual interior-point methods for multi-agent optimization
This paper presents a coordinated primal-dual interior point (PDIP) method for solving structured convex linear and quadratic programs (LP-QP) in a distributed manner. The considered class of problems represents a multi-agent setting, where the aggregated cost is to be minimized while respecting coupling constraints as well as local constraints of …