2022
DOI: 10.1007/978-3-031-22990-9_7
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…About 3000 parameters of the mirror surfaces are adjusted, during focusing of the mirror system.The faster setting up of the mirrors is very important for the accuracy of observations. For acceleration, it is proposed to use the Nesterov acceleration method in distributed form [16][17][18]. In Figure 3 on page 11, the dependence of the signal power on the number of iterations of the algorithm is given.…”
Section: Application For Orientation Improvement Of Radio Telescope's...mentioning
confidence: 99%
“…About 3000 parameters of the mirror surfaces are adjusted, during focusing of the mirror system.The faster setting up of the mirrors is very important for the accuracy of observations. For acceleration, it is proposed to use the Nesterov acceleration method in distributed form [16][17][18]. In Figure 3 on page 11, the dependence of the signal power on the number of iterations of the algorithm is given.…”
Section: Application For Orientation Improvement Of Radio Telescope's...mentioning
confidence: 99%
“…In the special case, when R(x, y) = x T By, (1) has been also widely studied, dating at least to the classic work of [6] (imaging inverse problems). Modern applications can be find in decentralized optimization [34,8]. Quadratic variant of the problem (1) also appeared in reinforcement learning [10].…”
Section: Bilinear Saddle Point Problemsmentioning
confidence: 99%