Convexity of a small ball under quadratic map
From MaRDI portal
(Redirected from Publication:896841)
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.
Recommendations
- scientific article; zbMATH DE number 3859880
- scientific article; zbMATH DE number 1191153
- Convexity of nonlinear image of a small ball with applications to optimization
- A note on the convexity of the indefinite joint numerical range
- Convexity of the image of a quadratic map via the relative entropy distance
Cites work
- Convexity of nonlinear image of a small ball with applications to optimization
- Convexity of the joint numerical range: Topological and differential geometric viewpoints.
- scientific article; zbMATH DE number 48359 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Local programming.
- On local convexity of quadratic transformations
- The convexity principle and its applications
Cited in
(6)- The convexity principle and its applications
- scientific article; zbMATH DE number 3859880 (Why is no real title available?)
- Convexity/nonconvexity certificates for power flow analysis
- Small angle limits of Hamilton's footballs
- Convexity of nonlinear image of a small ball with applications to optimization
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
This page was built for publication: Convexity of a small ball under quadratic map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896841)