Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
From MaRDI portal
Publication:5072587
DOI10.1137/20M1387407OpenAlexW3112132453WikidataQ114074118 ScholiaQ114074118MaRDI QIDQ5072587
Shengding Sun, Grigoriy Blekherman, Kevin Shu, Santanu S. Dey
Publication date: 29 April 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.04031
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
- Set-theoretic defining equations of the variety of principal minors of symmetric matrices
- On hyperbolicity cones associated with elementary symmetric polynomials
- Forms derived from the arithmetic-geometric inequality
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- A non-commutative version of Jacobi's equality on the cofactors of a matrix
- On sums of squares of \(K\)-nomials
- Polyhedral approximations of the semidefinite cone and their application
- Sparse PSD approximation of the PSD cone
- Hyperbolic programs, and their derivative relaxations
- On factor width and symmetric \(H\)-matrices
- Linear hyperbolic partial differential equation with constant coefficients
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Matrix Analysis
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- A quantitative version of Hurwitz' theorem on the arithmetic-geometric inequality.
- Semidefinite Optimization and Convex Algebraic Geometry
- On the derivative cones of polyhedral cones
- Cutting Plane Generation through Sparse Principal Component Analysis
- 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
- Principal submatrices V: some results concerning principal submatrices of arbitrary matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
