1 citations · 3 across the 6 of their papers we have counts for
8 papers
Lazy Lagrangians with Predictions for Online Learning
Daron Anderson, George Iosifidis, Douglas J. Leith
We consider the general problem of online convex optimization with time-varying additive constraints in the presence of predictions for the next cost and constraint functions. A no…
Separable Indecomposable Continuum with Exactly One Composant
Daron Anderson
Indecomposable continua with one composant are in the sense of being non-metrisable. We adapt the method of Smith to construct an example which is $\textit{…
Indecomposable Continuum with a Strong Non-Cut Point
Daron Anderson
We construct an indecomposable continuum with exactly one strong non-cut point. The method is an adaptation of Bellamy . We start with an -chain of indecomposable metric…
The Shore Point Existence Problem is Equivalent to the Non-Block Point Existence Problem
Daron Anderson
We prove the three propositions are equivalent: Every Hausdorff continuum has two or more shore points. Every Hausdorff continuum has two or more non-block points. $(c)…
Continuum Without Non-Block Points
Daron Anderson
For any composant and corresponding near-coherence class we prove the following are equivalent : (1) properly contains a dense…
Shore and Non-Block Points in Hausdorff Continua
Daron Anderson
We study the shore and non-block points of non-metric continua. We reduce the problem of showing a continuum to have non-block points to that of showing an indecomposable continuum…