.png){kind=icon}
.png){kind=icon}
Return
Distributed Cutting Plane Method via Sample Point Consensus
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2025.3547567.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article considers a general setup for the constrained convex optimization problem over jointly fully connected time-varying networks. We propose a novel cutting plane-based method that embeds a proximity-based consensus scheme for solving this (potentially nonsmooth) optimization problem. The consensus mechanism allows agents to select the same sample point and therefore reconstruct the centralized cut individually. Under convexity, we prove that agents' sample points converge to the optimal set of the global problem. Numerical tests show the performance of the algorithm.
Keywords:
Consensus
cutting plane
distributed optimization
multiagent network
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W