approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients
Clicks: 4
ID: 204489
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
0.9
/100
4 views
3 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #1,034 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
This paper considers the problem of solving the saddle-point problem over a network, which consists of multiple interacting agents. The global objective function of the problem is a combination of local convex-concave functions, each of which is only available to one agent. Our main focus is on the case where the projection steps are calculated approximately and the subgradients are corrupted by some stochastic noises. We propose an approximate version of the standard dual averaging method and show that the standard convergence rate is preserved, provided that the projection errors decrease at some appropriate rate and the noises are zero-mean and have bounded variance.
| Reference Key |
yuan2014mathematicalapproximate
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Deming Yuan;Yang Yang |
| Journal | journal of power sources |
| Year | 2014 |
| DOI |
10.1155/2014/202737
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.