Linearization functors on real convex sets
Optimization and Control
2013-07-25 v2 Combinatorics
Abstract
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to efficient computation. These operations are convex analogues of Hom functors, tensor products, symmetric powers, exterior powers and general Schur functors on vector spaces and lead to novel constructions even for polyhedra.
Cite
@article{arxiv.1203.0946,
title = {Linearization functors on real convex sets},
author = {Mauricio Velasco},
journal= {arXiv preprint arXiv:1203.0946},
year = {2013}
}
Comments
Major Revision. The article has been completely rewritten (except for abstract and first page of the introduction)