Convexity of a Small Ball Under Quadratic Map
Optimization and Control
2017-10-27 v1
Abstract
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We also generalize the notion of the joint numerical range of m-tuple of matrices by adding vector-dependent inhomogeneous terms and provide a sufficient condition for its convexity.
Keywords
Cite
@article{arxiv.1410.1553,
title = {Convexity of a Small Ball Under Quadratic Map},
author = {Anatoly Dymarsky},
journal= {arXiv preprint arXiv:1410.1553},
year = {2017}
}
Comments
15 pages