2022
DOI: 10.1109/tsp.2021.3123888
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Primal-Dual Method for Convex Optimization With Coupled Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 43 publications
0
6
0
Order By: Relevance
“…We consider constraint-coupled problems consisting of N subproblems coupled via both equality and inequality constraints [40,41]. We will assume the coupling constraints are themselves separable, i.e.…”
Section: A Problem Statementmentioning
confidence: 99%
“…We consider constraint-coupled problems consisting of N subproblems coupled via both equality and inequality constraints [40,41]. We will assume the coupling constraints are themselves separable, i.e.…”
Section: A Problem Statementmentioning
confidence: 99%
“…To meet the security needs of airports and high‐level matches, one must solve the problem of massive UAV jamming and improve the jamming rate and success rate. Some works have applied commonly used convex optimization methods to the distributed jamming problems of satellite navigation, such as the distributed sub gradient method [15] and primal‐dual method [16]. These methods have a sufficient theoretical basis and application support and can improve the jamming speed to a certain extent.…”
Section: Related Workmentioning
confidence: 99%
“…The existing optimization methods mainly use convex optimization theory [15,16], deep learning theory [17,18], multidimensional derivation technology [19,20] and other methods to optimize the system parameters for one or more indicators. In this kind of optimization system, the index has obvious two-way, while the massive UAV jamming optimization has the characteristics of target free feedback.…”
Section: Introductionmentioning
confidence: 99%
“…One can observes that the dual of (P1) has the same form with the classical decentralized unconstrained optimizaton (DUO) problem, leading to the natural idea of applying existing DUO algorithms to its dual. This approach has been adopted in numerous previous works [8][9][10][11][12][13][14][15][16][17][18][19][20]. However, a key challenge lies in dealing with the dual gradient or dual Email: jingwangli@outlook.com, houshengsu@gmail.com.…”
Section: Introductionmentioning
confidence: 99%