Achieving violation-free distributed optimization under coupling constraints
<|reference_start|>Achieving violation-free distributed optimization under coupling constraints: Constraint satisfaction is a critical component in a wide range of engineering applications, including but not limited to safe multi-agent control and economic dispatch in power systems. This study explores violation-free distributed optimization techniques for problems characterized by separable objective functions and coupling constraints. First, we incorporate auxiliary decision variables together with a network-dependent linear mapping to each coupling constraint. For the reformulated problem, we show that the projection of its feasible set onto the space of primal variables is identical to that of the original problem, which is the key to achieving all-time constraint satisfaction. Upon treating the reformulated problem as a min-min optimization problem with respect to auxiliary and primal variables, we demonstrate that the gradients in the outer minimization problem have a locally computable closed-form. Then, two violation-free distributed optimization algorithms are developed and their convergence under reasonable assumptions is analyzed. Finally, the proposed algorithm is applied to implement a control barrier function based controller in a distributed manner, and the results verify its effectiveness.<|reference_end|>
@article{liu2024achieving,
    title={Achieving violation-free distributed optimization under coupling
  constraints},
    author={Changxin Liu, Xiao Tan, Xuyang Wu, Dimos V. Dimarogonas, Karl H.
  Johansson},
    journal={arXiv preprint arXiv:2404.07609},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.07609},
    primaryClass={math.OC cs.SY eess.SY}
}