On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones
From MaRDI portal
Publication:2687062
DOI10.1007/s10107-022-01795-7OpenAlexW3157200198WikidataQ114228496 ScholiaQ114228496MaRDI QIDQ2687062
Pablo A. Parrilo, Dogyoon Song
Publication date: 1 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.02080
Semidefinite programming (90C22) Computational aspects related to convexity (52B55) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (1)
Cites Work
- Unnamed Item
- Eigenvectors of random matrices: A survey
- Expressing combinatorial optimization problems by linear programs
- Inequalities in Fourier analysis
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Adaptive estimation of a quadratic functional by model selection.
- Sparse PSD approximation of the PSD cone
- On factor width and symmetric \(H\)-matrices
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- Sum of squares basis pursuit with linear and second order cone programming
- High-Dimensional Probability
- Dvoretzky's theorem and the complexity of entanglement detection
- On Polyhedral Approximations of the Positive Semidefinite Cone
- Analysis of Boolean Functions
- Lifts of Convex Sets and Cone Factorizations
- Alice and Bob Meet Banach
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Quantum one-way communication can be exponentially stronger than classical communication
- Convex Analysis
This page was built for publication: On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones
