{"paper":{"title":"Average Point Pursuit using the Greedy Algorithm: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Andrey Bernstein, Niek J. Bouman","submitted_at":"2018-11-16T13:18:57Z","abstract_excerpt":"This paper considers a discrete-time decision problem wherein a decision maker has to track, on average, a sequence of inputs selected from a convex set $\\mathcal X \\subset \\mathbb{R}^d$ by choosing actions from a possibly non-convex feasible set $\\mathcal Y\\subset \\mathbb{R}^d$, where $\\mathcal X$ is in fact the convex hull of $\\mathcal Y$. We study some generalized variants of this problem, in which: (i) $\\mathcal X$ and $\\mathcal Y$ vary with time, and (ii) there might be a delay between them, in the sense that $\\mathcal X$ is the convex hull of the previous $\\mathcal Y$. We investigate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07734","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}