Distributed consensus-based solver for semi-definite programming: an optimization viewpoint

DOI10.1016/J.AUTOMATICA.2021.109737MaRDI QIDQ2665375zbMATH OpenOpenAlexFDO

Authors Wei-Jian Li, Xianlin Zeng, Yiguang Hong, Haibo Ji

Publication date 19 November 2021

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2021.109737

zbMATH Keywords

sparsitydistributed optimizationsemi-definite programmingconsensus-based algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Distributed optimization with closed convex set for multi-agent networks over directed graphs
• A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
• Fully Distributed Algorithms for Convex Optimization Problems
• Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
• Distributed convex optimization as a tool for solving \(f\)-consensus problems

Cites work

• A Distributed Algorithm for Solving a Linear Algebraic Equation
• A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization
• A fixed-point method for approximate projection onto the positive semidefinite cone
• An Arrow-Hurwicz-Uzawa type flow as least squares solver for network linear equations
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
• Decomposition in conic optimization with partially separable structure
• Distributed Computation of Linear Matrix Equations: An Optimization Perspective
• Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
• Distributed Maximum Likelihood Sensor Network Localization
• Distributed Nonsmooth Optimization with Coupled Inequality Constraints via Modified Lagrangian Function
• Distributed Online Linear Regressions
• Distributed Semidefinite Programming With Application to Large-Scale System Analysis
• Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Nonlinear systems.
• Positive definite completions of partial Hermitian matrices
• Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network
• Semidefinite Programming
• Stability of primal-dual gradient dynamics and applications to network optimization
• Subgradient methods for saddle-point problems
• The Role of Convexity in Saddle-Point Dynamics: Lyapunov Function and Robustness

Cited in

(3)

• Distributed Semidefinite Programming With Application to Large-Scale System Analysis
• An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
• Distributed optimal consensus of multi-agent systems: a randomized parallel approach

This page was built for publication: Distributed consensus-based solver for semi-definite programming: an optimization viewpoint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665375)