Polynomial Matrix Inequalities within Tame Geometry
Optimization and Control
2022-06-09 v1
Abstract
Polynomial matrix inequalities can be solved using hierarchies of convex relaxations, pioneered by Henrion and Lassere. In some cases, this might not be practical, and one may need to resort to methods with local convergence guarantees, whose development has been rather ad hoc, so far. In this paper, we explore several alternative approaches to the problem, with non-trivial guarantees available using results from tame geometry.
Cite
@article{arxiv.2206.03941,
title = {Polynomial Matrix Inequalities within Tame Geometry},
author = {Christos Aravanis and Johannes Aspman and Georgios Korpas and Jakub Marecek},
journal= {arXiv preprint arXiv:2206.03941},
year = {2022}
}
Comments
13 pages, 3 figures