Home › Entities › academia › Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm

Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm

Research article (Neurocomputing, 2022) · cited 19× · AI/ML
academia openalex:W4229375123
Press Enter · cited answer in seconds

Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm

Summary

Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm is a scholarly article[1].

Key Facts

  • Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm. Retrieved May 24, 2026, from https://4ort.xyz/entity/distributed-online-convex-optimization-with-a-bandit-primal-dual-mirror-descent-push-sum-algorithm
MLA “Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/distributed-online-convex-optimization-with-a-bandit-primal-dual-mirror-descent-push-sum-algorithm.
BibTeX @misc{4ortxyz_distributed-online-convex-optimization-with-a-bandit-primal-dual-mirror-descent-push-sum-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/distributed-online-convex-optimization-with-a-bandit-primal-dual-mirror-descent-push-sum-algorithm}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm — https://4ort.xyz/entity/distributed-online-convex-optimization-with-a-bandit-primal-dual-mirror-descent-push-sum-algorithm (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/distributed-online-convex-optimization-with-a-bandit-primal-dual-mirror-descent-push-sum-algorithm · Last refreshed: