Linearization functors on real convex sets

DOI10.1137/130930698MaRDI QIDQ2954374zbMATH OpenOpenAlexFDO

Authors Mauricio Velasco

Publication date 13 January 2017

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.0946

zbMATH Keywords

multilinear optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

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.

Recommendations

• Linear algebra of convex sets and the euler characteristic
• Optimization of linear-convex programs
• The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• Convexity. Selected chapters

Cited in

(4)

• Affine-compact functors
• Semidefinite approximations of conical hulls of measured sets
• Cross-positive linear maps, positive polynomials and sums of squares
• A general theory of tensor products of convex sets in Euclidean spaces

This page was built for publication: Linearization functors on real convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954374)