Cyclic convex bodies and optimization moment problems
DOI10.1016/J.LAA.2007.05.035zbMATH Open1146.52002OpenAlexW2030047647MaRDI QIDQ996313FDOQ996313
Authors: Rubén Puente
Publication date: 14 September 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.05.035
Recommendations
semi-infinite programmingdiscrete moment problemscyclic polytopesConvex bodiesgeneralized Vandermonde determinant
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Lectures on Polytopes
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Title not available (Why is that?)
- Dual representations of convex bodies and their polars
- Representability of convex sets by analytical linear inequality systems.
- Conjugacy for closed convex sets
- Discrete probability distributions and moment problem: Numerical aspects
- A theorem on cyclic polytopes
Cited In (4)
This page was built for publication: Cyclic convex bodies and optimization moment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996313)