# Cyclic convex bodies and optimization moment problems

```@article{Puente2007CyclicCB,
title={Cyclic convex bodies and optimization moment problems},
author={Rub{\'e}n Puente},
journal={Linear Algebra and its Applications},
year={2007},
volume={426},
pages={596-609}
}```
• R. Puente
• Published 15 October 2007
• Mathematics
• Linear Algebra and its Applications
11 Citations
Voronoi cells via linear inequality systems
• Mathematics, Computer Science
• 2012
Robust Linear Semi-infinite Optimization
• Computer Science
• 2014
The robust counterpart of an uncertain LSIO problem seldom enjoys the strong assumptions which are necessary to apply reduction or feasible point methods.
Selected Applications of Linear Semi-Infinite Systems Theory
• Mathematics
• 2020
In this paper we, firstly, review the main known results on systems of an arbitrary (possibly infinite) number of weak linear inequalities posed in the Euclidean space ℝ n \$\mathbb {R}^{n}\$ (i.e.,
FACES FOR TWO-QUBIT SEPARABLE STATES AND THE CONVEX HULLS OF TRIGONOMETRIC MOMENT CURVES
We analyze the facial structures of the convex set consisting of all two-qubit separable states. One of the faces is a four-dimensional convex body generated by the trigonometric moment curve arising
Preliminaries on Linear Semi-infinite Optimization
• Computer Science
• 2014
Ordinary (or finite) linear optimization, linear infinite optimization, and linear semi-infinite optimization (LO, LIO, and LSIO in short) deal with linear optimization problems, where the dimension
Addendum to: "An algebraic proof of the fundamental theorem of algebra"
We prove the fundamental theorem of algebra (FTA on brief) by using linear algebra. The proof which arises from a new equivalent reformulation of FTA also works for any infinite field, having root
Faces for two qubit separable states and the convex hulls of trigonometric moment curves
). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Modeling Uncertain Linear Semi-infinite Optimization Problems
• Computer Science
• 2014
In most LSIO applications part of the data are uncertain as a consequence of error measurements or estimations, which is inherent to the data in fields as environmental engineering, telecommunications, finance, spectrometry, health care, statistics, machine learning, or data envelopment analysis.
Qualitative Stability Analysis
• Computer Science
• 2014

## References

SHOWING 1-10 OF 15 REFERENCES
Global Optimization with Polynomials and the Problem of Moments
It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems.
Conjugacy for Closed Convex Sets
• Mathematics
• 2005
Even though the polarity is a well defined operation for arbitrary subsets in the Euclidean n-dimensional space, the related operation of conjugacy of faces appears defined in the literature
Neighborly and cyclic polytopes
Introduction. Let S be a finite set of points in n-space. A pair of points p and q of S are called neighbors if the segment joining them is an edge of the convex polytope spanned by S. Some years ago
Lectures on Polytopes
Based on a graduate course given at the Technische Universitat, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The clear and straightforward
DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES.
• Mathematics
Proceedings of the National Academy of Sciences of the United States of America
• 1962
Using Theorem 0 and the fact that H*(X, E*) may be written in terms of Lie algebra cohomology, Theorem 1 is completed using several spectral sequences in Lie algebra Cohomology.
An Introduction to Convex Polytopes
1 Convex Sets.- 1. The Affine Structure of ?d.- 2. Convex Sets.- 3. The Relative Interior of a Convex Set.- 4. Supporting Hyperplanes and Halfspaces.- 5. The Facial Structure of a Closed Convex Set.-
A theorem on cyclic polytopes
LetC(ν, d) represent a cyclic polytope withν vertices ind dimensions. A criterion is given for deciding whether a given subset of the vertices ofC(ν, d) is the set of vertices of some face ofC(ν, d).
Linear Semi-Infinite Optimization
• Mathematics
• 1998
MODELLING. Modelling with the Primal Problem. Modelling with the Dual Problem. LINEAR SEMI-INFINITE SYSTEMS. Alternative Theorems. Consistency. Geometry. Stability. THEORY OF LINEAR SEMI-INFINITE