DiscoverPolynomial OptimisationPositive Semidefinite Rank of Polytopes
Positive Semidefinite Rank of Polytopes

Positive Semidefinite Rank of Polytopes

Update: 2013-07-23
Share

Description

We define the positive semidefinite (psd) rank of a polytope P to be the size of the smallest cone of psd matrices that admits a lift of P. This can be thought of as a measure on how well semidefinite programming may be used to optimize over P. We will present an overview of the subject, several recent results, and some open problems.
Comments 
00:00
00:00
1.0x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Positive Semidefinite Rank of Polytopes

Positive Semidefinite Rank of Polytopes

Dr Mustapha Amrani

We and our partners use cookies to personalize your experience, to show you ads based on your interests, and for measurement and analytics purposes. By using our website and our services, you agree to our use of cookies as described in our Cookie Policy.