{'fraction_non_alphanumeric': 0.014397905759162303, 'fraction_numerical': 0.0, 'mean_word_length': 5.12, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Consistency of Moment Systems

Abstract An important question in the study of moment problems is to determine when a fixed point in ℝn lies in the moment cone of vectors , with μ a nonnegative measure. In associated optimization problems it is also important to be able to distinguish between the interior and boundary of the moment cone. Recent work of Dachuna-Castelle, Gamboa and Gassiat derived elegant computational characterizations for these problems, and for related questions with an upper bound on μ. Their technique involves a probabilistic interpretation and large deviations theory. In this paper a purely convex analytic approach is used, giving a more direct understanding of the underlying duality, and allowing the relaxation of their assumptions.