Home › Entities › academia › Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case

Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case

Research article (Automation and Remote Control, 2017) · cited 48× · AI/ML
academia openalex:W2586930666
Press Enter · cited answer in seconds

Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case

Summary

Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case is a scholarly article[1].

Key Facts

  • Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case'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). Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case. Retrieved May 24, 2026, from https://4ort.xyz/entity/stochastic-online-optimization-single-point-and-multi-point-non-linear-multi-armed-bandits-convex-and-strongly-convex-ca
MLA “Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/stochastic-online-optimization-single-point-and-multi-point-non-linear-multi-armed-bandits-convex-and-strongly-convex-ca.
BibTeX @misc{4ortxyz_stochastic-online-optimization-single-point-and-multi-point-non-linear-multi-armed-bandits-convex-and-strongly-convex-ca_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case}}, year = {2026}, url = {https://4ort.xyz/entity/stochastic-online-optimization-single-point-and-multi-point-non-linear-multi-armed-bandits-convex-and-strongly-convex-ca}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case — https://4ort.xyz/entity/stochastic-online-optimization-single-point-and-multi-point-non-linear-multi-armed-bandits-convex-and-strongly-convex-ca (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/stochastic-online-optimization-single-point-and-multi-point-non-linear-multi-armed-bandits-convex-and-strongly-convex-ca · Last refreshed: