55
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Empirical Properties of Optima in Free Semidefinite Programs

, , &
Pages 477-501 | Published online: 26 Oct 2021
 

Abstract

Semidefinite programming is based on optimization of linear functionals over convex sets defined by linear matrix inequalities, namely, inequalities of the formLA(X)=IA1X1AgXg0. Here, the Xj are real numbers and the set of solutions is called a spectrahedron. These inequalities make sense when the Xi are symmetric matrices of any size, n × n, and enter the formula though tensor product AiXi: The solution set of LA(X)0 is called a free spectrahedron since it contains matrices of all sizes and the defining “linear pencil” is “free” of the sizes of the matrices. In this article, we report on empirically observed properties of optimizers obtained from optimizing linear functionals over free spectrahedra restricted to matrices Xi of fixed size n × n. The optimizers we find are always classical extreme points. Surprisingly, in many reasonable parameter ranges, over 99.9% are also free extreme points. Moreover, the dimension of the active constraint, ker(LA(Xl)), is about twice what we expected. Another distinctive pattern regards reducibility of optimizing tuples (X1l,,Xgl). We give an algorithm for representing elements of a free spectrahedron as matrix convex combinations of free extreme points; these representations satisfy a very low bound on the number of free extreme points needed.

2010 MATHEMATICS SUBJECT CLASSIFICATION:

Conflict of interest

No potential conflict of interest was reported by the author(s).

Notes

1 As a consequence of Helton et al. [Citation30, Theorem 3.1], the existence of any defining tuple of diagonal matrices implies the existence of a minimal defining tuple of diagonal matrices. However, a non-minimal defining tuple for a free polytope need not be simultaneously diagonalizable.

2 If the algorithm is designed so that each γ̂j is a classical extreme point of the relevant spectrahedron, then this method always succeeds in at most μ steps.

3 Since Kg,d,n is discrete random variable, some authors may use the term probability mass function (PMF) instead of probability density function (PDF).

4 NCSE has since been updated to use the Mathematica 12 SDP by default. As an option, a user may still use the NCAlgebra SDP.

Additional information

Funding

Research supported by the NSF grant DMS-1500835.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 360.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.