• Corpus ID: 232478816

Distributed synchronous and asynchronous algorithms for semi-definite programming with diagonal constraints

  title={Distributed synchronous and asynchronous algorithms for semi-definite programming with diagonal constraints},
  author={Xia Jiang and Xianlin Zeng and Jian Sun and Jie Chen},
This paper develops distributed synchronous and asynchronous algorithms for the large-scale semi-definite programming with diagonal constraints, which has wide applications in combination optimization, image processing and community detection. The information of the semi-definite programming is allocated to multiple interconnected agents such that each agent aims to find a solution by communicating to its neighbors. Based on low-rank property of solutions and the Burer-Monteiro factorization… 

Figures and Tables from this paper


Distributed Semidefinite Programming With Application to Large-Scale System Analysis
This paper shows that in case the coupled problem has an inherent tree structure, it is possible to devise an efficient distributed algorithm for solving such problems, which relies on predictor–corrector primal-dual interior-point methods.
A fast distributed algorithm for decomposable semidefinite programs
A fast, parallelizable algorithm for an arbitrary decomposable semidefinite program, based on the alternating direction method of multipliers, which has a guaranteed convergence under very mild assumptions and enables solving real-world large-scale conic optimization problems.
Scheduled-Asynchronous Distributed Algorithm for Optimal Power Flow
This paper proposes the scheduled-asynchronous algorithm to solve a distributed semidefinite programming formulation of the OPF problem, and establishes the asymptotic convergence properties to the primal-dual optimizer when the orientation is acyclic.
Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs
It is proved that the block-coordinate maximization algorithm applied to the non-convex Burer-Monteiro method globally converges to a first-order stationary point with a sublinear rate without any assumptions on the problem, and it is shown that this algorithm converges linearly around a local maximum provided that the objective function exhibits quadratic decay.
The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
In this paper, we propose a low-rank coordinate descent approach to structured semidefinite programming with diagonal constraints. The approach, which we call the Mixing method, is extremely simple
Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints
This article aims at a distributed design to minimize the nuclear norm under linear equality constraints over a multiagent network and shows that the algorithm converges to an optimal solution with a rate of $\mathcal O(1/t)$.
Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
In this paper, we propose a distributed algorithm for solving coupled problems with chordal sparsity or an inherent tree structure which relies on primal–dual interior-point methods. We achieve this
Distributed Computation for Solving the Sylvester Equation Based on Optimization
This letter solves the Sylvester equation in the form of $AX+XB=C $ in a distributed way, and proposes a distributed continuous-time algorithm when there is at least one exact solution to the
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality
This paper establishes a Grothendieck-type inequality that proves that all the local maxima and dangerous saddle points are within a small multiplicative gap from the global maximum of the rank-constrained SDP, and proves that SDPs can be solved within a known accuracy.
Distributed Optimization Design for Computation of Algebraic Riccati Inequalities.
A distributed optimization design to compute continuous-time algebraic Riccati inequalities (ARIs), where the information of matrices is distributed among agents and converges to a solution if ARI is feasible for any initial condition.