An algorithm for minimum cardinality generators of cones
Optimization and Control
2024-12-03 v1
Abstract
This paper presents a novel proof that for any convex cone, the size of conically independent generators is at most twice that of minimum cardinality generators. While this result is known for linear spaces, we extend it to general cones through a decomposition into linear and pointed components. Our constructive approach leads to a polynomial-time algorithm for computing minimum cardinality generators of finitely generated cones, improving upon existing methods that only compute conically independent generators.
Cite
@article{arxiv.2412.01451,
title = {An algorithm for minimum cardinality generators of cones},
author = {Matthias Georg Mayer and Fabian von der Warth},
journal= {arXiv preprint arXiv:2412.01451},
year = {2024}
}
Comments
6 pages