Maximum-volume symmetric gauge ball problem on the convex cone of positive definite matrices and convexity of optimal sets

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

In this paper we show that the radius of the largest symmetric gauge ball inscribed in the convex cone PD(n) of n×n positive definite matrices equipped with the Finsler metric inherited from a unitarily invariant norm is precisely the minimal eigenvalue of its center. We then solve Todd's largest dual ellipsoids problem [Math. Program. Ser. B, 117 (2009), pp. 425-434] for unitarily invariant norms, i.e., the problem of maximizing the product of the unitarily invariant norm distances to boundaries of the cone and its dual cone. We further show that the optimal set of maximizers forms a convex cone and is a closed geodesically convex subset of the Riemannian manifold PD(n). This in particular provides a one-parameter family of strictly increasing solid convex (in both a Euclidean and a Riemannian sense) cones of positive definite matrices which starts from the optimal set and covers PD(n).

Original languageEnglish
Pages (from-to)1275-1288
Number of pages14
JournalSIAM Journal on Optimization
Volume21
Issue number4
DOIs
StatePublished - 2011
Externally publishedYes

Keywords

  • Convexity
  • Interior-point method
  • Maximum-volume ellipsoid problem
  • Positive definite matrix
  • Search direction
  • Symmetric gauge ball
  • Unitarily invariant norm

Fingerprint

Dive into the research topics of 'Maximum-volume symmetric gauge ball problem on the convex cone of positive definite matrices and convexity of optimal sets'. Together they form a unique fingerprint.

Cite this