Sparse PSD approximation of the PSD cone
From MaRDI portal
Publication:2118107
DOI10.1007/s10107-020-01578-yzbMath1489.90104arXiv2002.02988OpenAlexW3092933581MaRDI QIDQ2118107
Santanu S. Dey, Shengding Sun, Grigoriy Blekherman, Marco Molinaro
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.02988
Related Items (7)
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Evaluating approximations of the semidefinite cone with trace normalized distance ⋮ On eigenvalues of symmetric matrices with PSD principal submatrices ⋮ On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones ⋮ Subset Selection and the Cone of Factor-Width-k Matrices ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
Uses Software
Cites Work
- The road to deterministic matrices with the restricted isometry property
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Approximating polyhedra with sparse inequalities
- The restricted isometry property and its implications for compressed sensing
- A simple proof of the restricted isometry property for random matrices
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Theoretical challenges towards cutting-plane selection
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Polyhedral approximations of the semidefinite cone and their application
- Sparsity of integer formulations for binary programs
- Coordinated cutting plane generation via multi-objective separation
- On factor width and symmetric \(H\)-matrices
- Concentration Inequalities
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Solving Real-World Linear Programs: A Decade and More of Progress
- Matrix Analysis
- Mean, Median and Mode in Binomial Distributions
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Combinatorial Designs
- Sparsity of Lift-and-Project Cutting Planes
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Stable signal recovery from incomplete and inaccurate measurements
- Combinatorial Problems
- The Nonexistence of Certain Finite Projective Planes
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Sparse PSD approximation of the PSD cone
