Convexity of a small ball under quadratic map

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 [1] in the case of a quadratic map. We also generalize the notion of the joint numerical range of m-tuple of matrices by adding vector-dependent inhomogeneous term and provide a sufficient condition for its convexity.

Original languageEnglish
Article number13356
Pages (from-to)109-123
Number of pages15
JournalLinear Algebra and Its Applications
Volume488
DOIs
StatePublished - Jan 1 2016

Bibliographical note

Publisher Copyright:
© 2015 Elsevier Inc.

Funding

I would like to thank Tudor Dimofte, Konstantin Turitsyn and Jamin Sheriff for useful discussions and gratefully acknowledge support from the grant RFBR 15-01-04217 .

FundersFunder number
Russian Foundation for Basic Research15-01-04217

    Keywords

    • Convexity
    • Joint numerical range
    • Quadratic transformation (map)
    • Trust region problem

    ASJC Scopus subject areas

    • Algebra and Number Theory
    • Numerical Analysis
    • Geometry and Topology
    • Discrete Mathematics and Combinatorics

    Fingerprint

    Dive into the research topics of 'Convexity of a small ball under quadratic map'. Together they form a unique fingerprint.

    Cite this